Process Discovery using Integer Linear Programming

The research domain of process discovery aims at constructing a process model (e.g. a Petri net) which is an abstract representation of an execution log. Such a model should (1) be able to reproduce the log under consideration and (2) be independent of the number of cases in the log. In this paper, we present a process discovery algorithm where we use concepts taken from the language-based theory of regions, a well-known Petri net research area. We identify a number of shortcomings of this theory from the process discovery perspective, and we provide solutions based on integer linear programming.

[1]  Boudewijn F. van Dongen,et al.  Process Mining: Overview and Outlook of Petri Net Discovery Algorithms , 2009, Trans. Petri Nets Other Model. Concurr..

[2]  Kees M. van Hee,et al.  Token History Petri Nets , 2008, Fundam. Informaticae.

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

[4]  Sebastian Mauser,et al.  How to synthesize nets from languages - a survey , 2007, 2007 Winter Simulation Conference.

[5]  Jianmin Wang,et al.  Mining process models with non-free-choice constructs , 2007, Data Mining and Knowledge Discovery.

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

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

[8]  Robin Bergenthum,et al.  Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios , 2007, ICATPN.

[9]  Robin Bergenthum,et al.  Can I Execute My Scenario in Your Net? VipTool Tells You! , 2006, ICATPN.

[10]  P. Darondeau,et al.  Distributed implementations of Ramadge-Wonham supervisory control with Petri nets , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[11]  Jörg Desel,et al.  Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) , 2005 .

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

[13]  Boudewijn F. van Dongen,et al.  Process Mining for Ubiquitous Mobile Systems: An Overview and a Concrete Algorithm , 2004, UMICS.

[14]  Boudewijn F. van Dongen,et al.  Workflow mining: A survey of issues and approaches , 2003, Data Knowl. Eng..

[15]  Wil M. P. van der Aalst,et al.  Rediscovering workflow models from event-based data using little thumb , 2003, Integr. Comput. Aided Eng..

[16]  Philippe Darondeau,et al.  Deriving Unbounded Petri Nets from Formal Languages , 1998, CONCUR.

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

[18]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[19]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

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

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

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

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

[24]  Wolfgang Reisig.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[25]  Peter Radford,et al.  Petri Net Theory and the Modeling of Systems , 1982 .

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

[27]  van Bf Boudewijn Dongen.  Process mining and verification , 2007 .

[28]  Wil M.P. van der Aalst,et al.  Process Mining : A Two-Step Approach using Transition Systems and Regions , 2006 .

[29]  Jörg Desel,et al.  Free choice Petri nets , 1995 .