Discovering Local Concurrency Relations in Business Process Event Logs
Detecting concurrency relations between events is a fundamental primitive in process mining. Existing approaches to this problem identify concurrency relations between pairs of event types under a global interpretation. If two event types are found to be concurrent, every occurrence of one event type is deemed to be concurrent to one occurrence of the other. In practice, this assumption not always holds. This paper proposes a finer-grained approach, whereby two event types may be in a concurrency relation relative to one state of the process, but not relative to other states, i.e. the concurrency relation holds locally. Experimental results both with artificial and real-life logs show that the proposed local concurrency detection approach improves the accuracy of existing concurrency detection techniques.
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.
Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Divisions:||Current > Schools > School of Information Systems
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Copyright Owner:||Copyright 2016 The Author(s)|
|Deposited On:||27 Jul 2016 00:59|
|Last Modified:||27 Jul 2016 05:11|
Repository Staff Only: item control page