Transition Systems Reduction: Balancing between Precision and Simplicity

Transition systems are a powerful formalism, which is widely used for process model representation. A number of approaches were proposed in the process mining field to tackle the problem of constructing transition systems from event logs. Existing approaches discover transition systems that are either too large or too small. In this paper we propose an original approach to discover transition systems that perfectly fit event logs and whose size is adjustable depending on the user’s need. The proposed approach allows the ability to achieve a required balance between simple and precise models.

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

[2]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[3]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[4]  Alexander L. Wolf,et al.  Discovering models of software processes from event-based data , 1998, TSEM.

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

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

[7]  Boudewijn F. van Dongen,et al.  ProM 6: The Process Mining Toolkit , 2010, BPM.

[8]  Philippe Darondeau,et al.  The Synthesis Problem for Elementary Net Systems is NP-Complete , 1997, Theor. Comput. Sci..

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

[10]  Leonardo Mariani,et al.  Inferring state-based behavior models , 2006, WODA '06.

[11]  Wil M. P. van der Aalst,et al.  Process Mining - Discovery, Conformance and Enhancement of Business Processes , 2011 .

[12]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

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

[14]  Josep Carmona,et al.  Process Mining from a Basis of State Regions , 2010, Petri Nets.

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

[16]  Boudewijn F. van Dongen,et al.  On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery , 2012, OTM Conferences.

[17]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

[19]  Josep Carmona,et al.  Region-Based Foldings in Process Discovery , 2013, IEEE Transactions on Knowledge and Data Engineering.

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