<abstract xmlns="http://www.w3.org/1999/xhtml"><p>α-algorithm is suitable to discover a large class of workflow (WF) nets based on the behaviour recorded in event logs, with the main limiting assumption that the event log is complete. Our research has been aimed at finding ways of discovering business process models based on examples of traces, ie, logs of workflow actions that do not meet the requirement of completeness. In this aim, we have modified the existing and introduced a new relation between activities recorded in the event log, which has led to a partial correction of the process models discovering technique, including the α-algorithm. We have also introduced the notion of causally complete logs, from which our modified algorithm can produce the same result as the α-algorithm from complete logs. The effect of these modifications on the efficiency of the process model discovering is mostly evident for business processes in which many activities can be performed in parallel. The application of the modified method for discovering block-structured models of parallel business processes is presented in this paper.</p></abstract>

α-algorithm is suitable to discover a large class of workflow (WF) nets based on the behaviour recorded in event logs, with the main limiting assumption that the event log is complete. Our research has been aimed at finding ways of discovering business process models based on examples of traces, ie, logs of workflow actions that do not meet the requirement of completeness. In this aim, we have modified the existing and introduced a new relation between activities recorded in the event log, which has led to a partial correction of the process models discovering technique, including the α-algorithm. We have also introduced the notion of causally complete logs, from which our modified algorithm can produce the same result as the α-algorithm from complete logs. The effect of these modifications on the efficiency of the process model discovering is mostly evident for business processes in which many activities can be performed in parallel. The application of the modified method for discovering block-structured models of parallel business processes is presented in this paper.

Discovering Block–Structured Parallel Process Models from Causally Complete Event Logs

Faculty of Technical Sciences, Kosovska Mitrovica, Kneza Milosa 7, Kosovska Mitrovica, 38220, Serbia

University of Belgrade, Faculty of Electrical Engineering, Bulevar kralja Aleksandra 73, Belgrade, 11000, Serbia

Journal of Electrical Engineering

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

α-algorithm is suitable to discover a large class of workflow (WF) nets based on the behaviour recorded in event logs, with the main limiting assumption that...

Discovering Block–Structured Parallel Process Models from Causally Complete Event Logs

Online veröffentlicht: 14. Mai 2016

Seitenbereich: 111 - 123

Eingereicht: 15. Dez. 2015

DOI: https://doi.org/10.1515/jee-2016-0016

Schlüsselwörter
process mining, business process model discovery, block-structured parallel process models, complete log, α-algorithm

© Faculty of Electrical Engineering and Information Technology, Slovak University of Technology

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Discovering Block–Structured Parallel Process Models from Causally Complete Event Logs

Online veröffentlicht: 14. Mai 2016

Seitenbereich: 111 - 123

Eingereicht: 15. Dez. 2015

DOI: https://doi.org/10.1515/jee-2016-0016

Schlüsselwörterprocess mining, business process model discovery, block-structured parallel process models, complete log, α-algorithm

© Faculty of Electrical Engineering and Information Technology, Slovak University of Technology

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
process mining, business process model discovery, block-structured parallel process models, complete log, α-algorithm