On the discovery of process models from their instances

San Yih Hwang, Wan-Shiou Yang

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow management. In this paper, we present a framework and algorithms that derive the underlying process model from past executions. The process model employs a directed graph for representing the control dependencies among activities and associates a Boolean function on each edge to indicate the condition under which the edge is to be enabled. By modeling the execution of an activity as an interval, we have developed an algorithm that derives the directed graph in a faster, more accurate manner. This algorithm is further enhanced with a noise handling mechanism to tolerate noise, which frequently occur in the real world. Experimental results show that the proposed algorithm outperforms the existing ones in terms of efficiency and quality.

Original languageEnglish
Pages (from-to)41-57
Number of pages17
JournalDecision Support Systems
Volume34
Issue number1
DOIs
Publication statusPublished - 2002 Dec 1

Fingerprint

Directed graphs
Noise
Reengineering
Boolean functions
Workflow
Process model
Process Model
Industry
Directed graph
Graph
Business process
Workflow management
Process reengineering
Modeling
Boolean Functions
Real World
Associates

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Information Systems
  • Developmental and Educational Psychology
  • Arts and Humanities (miscellaneous)
  • Information Systems and Management

Cite this

@article{14863db4bd31426997013be46e92eb18,
title = "On the discovery of process models from their instances",
abstract = "A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow management. In this paper, we present a framework and algorithms that derive the underlying process model from past executions. The process model employs a directed graph for representing the control dependencies among activities and associates a Boolean function on each edge to indicate the condition under which the edge is to be enabled. By modeling the execution of an activity as an interval, we have developed an algorithm that derives the directed graph in a faster, more accurate manner. This algorithm is further enhanced with a noise handling mechanism to tolerate noise, which frequently occur in the real world. Experimental results show that the proposed algorithm outperforms the existing ones in terms of efficiency and quality.",
author = "Hwang, {San Yih} and Wan-Shiou Yang",
year = "2002",
month = "12",
day = "1",
doi = "10.1016/S0167-9236(02)00008-8",
language = "English",
volume = "34",
pages = "41--57",
journal = "Decision Support Systems",
issn = "0167-9236",
publisher = "Elsevier",
number = "1",

}

On the discovery of process models from their instances. / Hwang, San Yih; Yang, Wan-Shiou.

In: Decision Support Systems, Vol. 34, No. 1, 01.12.2002, p. 41-57.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On the discovery of process models from their instances

AU - Hwang, San Yih

AU - Yang, Wan-Shiou

PY - 2002/12/1

Y1 - 2002/12/1

N2 - A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow management. In this paper, we present a framework and algorithms that derive the underlying process model from past executions. The process model employs a directed graph for representing the control dependencies among activities and associates a Boolean function on each edge to indicate the condition under which the edge is to be enabled. By modeling the execution of an activity as an interval, we have developed an algorithm that derives the directed graph in a faster, more accurate manner. This algorithm is further enhanced with a noise handling mechanism to tolerate noise, which frequently occur in the real world. Experimental results show that the proposed algorithm outperforms the existing ones in terms of efficiency and quality.

AB - A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow management. In this paper, we present a framework and algorithms that derive the underlying process model from past executions. The process model employs a directed graph for representing the control dependencies among activities and associates a Boolean function on each edge to indicate the condition under which the edge is to be enabled. By modeling the execution of an activity as an interval, we have developed an algorithm that derives the directed graph in a faster, more accurate manner. This algorithm is further enhanced with a noise handling mechanism to tolerate noise, which frequently occur in the real world. Experimental results show that the proposed algorithm outperforms the existing ones in terms of efficiency and quality.

UR - http://www.scopus.com/inward/record.url?scp=0036885513&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036885513&partnerID=8YFLogxK

U2 - 10.1016/S0167-9236(02)00008-8

DO - 10.1016/S0167-9236(02)00008-8

M3 - Article

AN - SCOPUS:0036885513

VL - 34

SP - 41

EP - 57

JO - Decision Support Systems

JF - Decision Support Systems

SN - 0167-9236

IS - 1

ER -