Computing Alignments of Event Data and Process Models

The aim of conformance checking is to assess whether a process model and event data, recorded in an event log, conform to each other. In recent years, alignments have proven extremely useful for calculating conformance statistics. Computing optimal alignments is equivalent to solving a shortest path problem on the state space of the synchronous product net of a process model and event data. State-of-the-art alignment based conformance checking implementations exploit the \(A^* \)-algorithm, a heuristic search method for shortest path problems, and include a wide range of parameters that likely influence their performance. In previous work, we presented a preliminary and exploratory analysis of the effect of these parameters. This paper extends the aforementioned work by means of large-scale statistically-sound experiments that describe the effects and trends of these parameters for different populations of process models. Our results show that, indeed, there exist parameter configurations that have a significant positive impact on alignment computation efficiency.

[1]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[2]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[3]  Wil M. P. van der Aalst,et al.  Conformance checking of processes based on monitoring real behavior , 2008, Inf. Syst..

[4]  Massimiliano de Leoni,et al.  Aligning Real Process Executions and Prescriptive Process Models through Automated Planning , 2017, Expert Syst. Appl..

[5]  A Arya Adriansyah,et al.  Aligning observed and modeled behavior , 2014 .

[6]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[7]  Wil M. P. van der Aalst,et al.  Single-Entry Single-Exit decomposed conformance checking , 2014, Inf. Syst..

[8]  W. Kruskal,et al.  Use of Ranks in One-Criterion Variance Analysis , 1952 .

[9]  Benoît Depaire,et al.  PTandLogGenerator: A Generator for Artificial Event Data , 2016, BPM.

[10]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[11]  Boudewijn F. van Dongen,et al.  Replaying history on process models for conformance checking and performance analysis , 2012, WIREs Data Mining Knowl. Discov..

[12]  Boudewijn F. van Dongen,et al.  Tuning Alignment Computation: An Experimental Evaluation , 2017, ATAED@Petri Nets/ACSD.

[13]  Wil M. P. van der Aalst,et al.  RapidProM: Mine Your Processes and Not Just Your Data , 2017, ArXiv.

[14]  Ernst W. Mayr An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[15]  Josep Carmona,et al.  A Recursive Paradigm for Aligning Observed Behavior of Large Structured Process Models , 2016, BPM.

[16]  Marwan Hassani,et al.  Online conformance checking: relating event streams to process models using prefix-alignments , 2017, International Journal of Data Science and Analytics.

[17]  Wil M. P. van der Aalst,et al.  Scientific workflows for process mining: building blocks, scenarios, and implementation , 2015, International Journal on Software Tools for Technology Transfer.

[18]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[19]  Wil M. P. van der Aalst,et al.  Decomposing Petri nets for process mining: A generic approach , 2013, Distributed and Parallel Databases.