Affiliations: Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands. [email protected] | Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands. [email protected]
Note: [] Address for correspondence: Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, PO Box 513, 5600 MB, Eindhoven, The Netherlands.
Abstract: The two most prominent process mining tasks are process discovery (i.e., learning a process model from an event log) and conformance checking (i.e., diagnosing and quantifying differences between observed and modeled behavior). The increasing availability of event data makes these tasks highly relevant for process analysis and improvement. Therefore, process mining is considered to be one of the key technologies for Business Process Management (BPM). However, as event logs and process models grow, process mining becomes more challenging. Therefore, we propose an approach to decompose process mining problems into smaller problems using the notion of passages. A passage is a pair of two non-empty sets of activities (X, Y) such that the set of direct successors of X is Y and the set of direct predecessors of Y is X. Any Petri net can be partitioned using passages. Moreover, process discovery and conformance checking can be done per passage and the results can be aggregated. This has advantages in terms of efficiency and diagnostics. Moreover, passages can be used to distribute process mining problems over a network of computers. Passages are supported through ProM plug-ins that automatically decompose process discovery and conformance checking tasks.
Keywords: process mining, conformance checking, process discovery, distributed computing, business process management
