Reducing complexity of large EPCs
Polyvyanyy, Artem, Smirnov, Sergey, & Weske, Mathias (2008) Reducing complexity of large EPCs. In Lecture Notes in Informatics : Modellierung betrieblicher Informationssysteme, Gesellschaft für Informatik, Bonn, Saarbrücken, Germany, pp. 195-207.
Business processes are an important instrument for understanding and improving how companies provide goods and services to customers. Therefore, many companies have documented their business processes well, often in the Event-driven Process Chains (EPC). Unfortunately, in many cases the resulting EPCs are rather complex, so that the overall process logic is hidden in low level process details. This paper proposes abstraction mechanisms for process models that aim to reduce their complexity, while keeping the overall process structure. We assume that functions are marked with efforts and splits are marked with probabilities. This information is used to separate important process parts from less important ones. Real world process models are used to validate the approach.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600)|
|Divisions:||Current > QUT Faculties and Divisions > Science & Engineering Faculty|
|Deposited On:||30 Apr 2014 00:37|
|Last Modified:||12 May 2014 02:46|
Repository Staff Only: item control page