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

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.K e y w o r d s: process mining, business process model discovery, block-structured parallel process models, complete log, α -algorithm

Weakly Complete Event Logs in Process Mining

“…Besides defining weakly complete event logs, this paper will present the results of experimental analysis carried out on examples of real business processes with the goal to discover the size of weakly complete event logs for observed processes expressed in the number of traces. The obtained results will be compared to the results of the experimental analysis carried out for the same processes on complete and causally complete event logs, which is presented in detail in [5]. In that way we will be able to show the improvement we made on weakly complete event logs in comparison to causally complete event logs [5] in regard of obtaining the valid model of parallel business processes based on the least possible number of traces from the event logs.…”

“…The obtained results will be compared to the results of the experimental analysis carried out for the same processes on complete and causally complete event logs, which is presented in detail in [5]. In that way we will be able to show the improvement we made on weakly complete event logs in comparison to causally complete event logs [5] in regard of obtaining the valid model of parallel business processes based on the least possible number of traces from the event logs.…”

“…To achieve this, we have partially modified the technique of process model discovering, and also the α-algorithm itself [1,2,3] by introducing the relation of indirect precedence as another basic relation between the activities recorded in the event log [5,6]. Within that goal we firstly defined the so called causally complete event logs, which do not fulfil conditions of completeness, and yet using our modified algorithm α || -algorithm) we can reconstruct the original network of a parallel bussiness process.…”

“…Within that goal we firstly defined the so called causally complete event logs, which do not fulfil conditions of completeness, and yet using our modified algorithm α || -algorithm) we can reconstruct the original network of a parallel bussiness process. Obtaining block-structured parallel business process model with our modified method based on the event logs which fulfil the requirements of casual completeness is presented in [5].…”

A Method for Mining Process Models With Indirect Dependencies via Petri Nets

“…This section first reviews the concepts and notions of sequence [21]- [24], multi-set [25], [26], trace [27], [28], event log [29]- [31], Petri net [32]- [43], and indirect dependency [5]. Petri net can be used not only for modeling [41]- [43], but also for cycle-time analysis [32], resource management [33]- [35], detecting errors [36], and service net analysis [39].…”