Divide-and-Conquer Strategies for Process Mining

The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphical representation, clear semantics and expressive power. The theory of regions can be used to transform a log into a Petri net, but unfortunately the transformation requires algorithms with high complexity. This paper provides techniques to overcome this limitation. Either by using decomposition techniques, or by clustering events in the log and working on projections, the proposed approach can be used to widen the applicability of classical region-based techniques.

[1]  Philippe Darondeau,et al.  Polynomial Algorithms for the Synthesis of Bounded Nets , 1995, TAPSOFT.

[2]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[3]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[4]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[5]  Robin Bergenthum,et al.  Process Mining Based on Regions of Languages , 2007, BPM.

[6]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[7]  Walter Vogler,et al.  Modular Construction and Partial Order Semantics of Petri Nets , 1992, Lecture Notes in Computer Science.

[8]  Boudewijn F. van Dongen,et al.  Process mining: a two-step approach to balance between underfitting and overfitting , 2008, Software & Systems Modeling.

[9]  Boudewijn F. van Dongen,et al.  ProM 4.0: Comprehensive Support for Real Process Analysis , 2007, ICATPN.

[10]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[11]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Mogens Nielsen,et al.  TAPSOFT '95: Theory and Practice of Software Development , 1995, Lecture Notes in Computer Science.

[13]  Luciano Lavagno,et al.  Deriving Petri Nets for Finite Transition Systems , 1998, IEEE Trans. Computers.

[14]  Jarke J. van Wijk,et al.  Visualization of State Transition Graphs , 2001, INFOVIS.

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

[16]  Edwin R. Hancock,et al.  Eigenspaces for Graphs , 2002, Int. J. Image Graph..

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

[18]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[19]  Josep Carmona,et al.  A Region-Based Algorithm for Discovering Petri Nets from Event Logs , 2008, BPM.

[20]  W.M.P. van der Aalst,et al.  On Petri-net synthesis and attribute-based visualization , 2007 .

[21]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[22]  Boudewijn F. van Dongen,et al.  Process Discovery using Integer Linear Programming , 2009, Fundam. Informaticae.

[23]  Boudewijn F. van Dongen,et al.  Process Mining Based on Clustering: A Quest for Precision , 2007, Business Process Management Workshops.

[24]  Guido Governatori,et al.  Compliance aware business process design , 2008 .

[25]  Jetty Kleijn,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings , 2007, ICATPN.

[26]  Wolfgang Reisig,et al.  The synthesis problem of Petri nets , 1993, Acta Informatica.

[27]  Luciano Lavagno,et al.  A Symbolic Algorithm for the Synthesis of Bounded Petri Nets , 2008, Petri Nets.