A Framework for Estimating Simplicity of Automatically Discovered Process Models Based on Structural and Behavioral Characteristics

A plethora of algorithms for automatically discovering process models from event logs has emerged. The discovered models are used for analysis and come with a graphical flowchart-like representation that supports their comprehension by analysts. According to the Occam’s Razor principle, a model should encode the process behavior with as few constructs as possible, that is, it should not be overcomplicated without necessity. The simpler the graphical representation, the easier the described behavior can be understood by a stakeholder. Conversely, and intuitively, a complex representation should be harder to understand. Although various conformance checking techniques that relate the behavior of discovered models to the behavior recorded in event logs have been proposed, there are no methods for evaluating whether this behavior is represented in the simplest possible way. Existing techniques for measuring the simplicity of discovered models focus on their structural characteristics such as size or density, and ignore the behavior these models encoded. In this paper, we present a conceptual framework that can be instantiated into a concrete approach for estimating the simplicity of a model, considering the behavior the model describes, thus allowing a more holistic analysis. The reported evaluation over real-life event logs for several instantiations of the framework demonstrates its feasibility in practice.

[1]  Tullio Ceccherini-Silberstein,et al.  On the entropy of regular languages , 2003, Theor. Comput. Sci..

[2]  Grzegorz J. Nalepa,et al.  Square Complexity Metrics for Business Process Models , 2012, ABICT.

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

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

[5]  Richard Mayr,et al.  Deciding Bisimulation-Like Equivalences with Finite-State Processes , 1998, ICALP.

[6]  Wil M. P. van der Aalst,et al.  Data Science in Action , 2016 .

[7]  Artem Polyvyanyy,et al.  Structuring process models , 2012 .

[8]  Wolfgang Reisig,et al.  Understanding Petri Nets Modeling Techniques, Analysis Methods, Case Studies , 2013, Bull. EATCS.

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[10]  Jorge Cardoso,et al.  How to Measure the Control-flow Complexity of Web Processes and Workflows , 2005 .

[11]  Benoît Depaire,et al.  An Improved Way for Measuring Simplicity During Process Discovery , 2018, EOMAS@CAiSE.

[12]  Marlon Dumas,et al.  Split miner: automated discovery of accurate and simple business process models from event logs , 2019, Knowledge and Information Systems.

[13]  Volker Gruhn,et al.  Complexity Metrics for business Process Models , 2006, BIS.

[14]  Moe Thandar Wynn,et al.  Reduction rules for YAWL workflows with cancellation regions and OR-joins , 2009, Inf. Softw. Technol..

[15]  Wolfgang Reisig,et al.  Understanding Petri nets , 1995, IEEE Parallel & Distributed Technology: Systems & Applications.

[16]  Boudewijn F. van Dongen,et al.  The ProM Framework: A New Era in Process Mining Tool Support , 2005, ICATPN.

[17]  Wil M. P. van der Aalst,et al.  Process mining using BPMN: relating event logs and process models , 2015, Software & Systems Modeling.

[18]  Jan Mendling,et al.  Monotone Precision and Recall Measures for Comparing Executions and Specifications of Dynamic Systems , 2018, ACM Trans. Softw. Eng. Methodol..

[19]  P. Grünwald The Minimum Description Length Principle (Adaptive Computation and Machine Learning) , 2007 .

[20]  Sander J. J. Leemans,et al.  Discovering Block-Structured Process Models from Event Logs - A Constructive Approach , 2013, Petri Nets.

[21]  Wil M. P. van der Aalst,et al.  E-Government Services: Comparing Real and Expected User Behavior , 2017, Business Process Management Workshops.