Discovering Block-Structured Process Models from Incomplete Event Logs

One of the main challenges in process mining is to discover a process model describing observed behaviour in the best possible manner. Since event logs only contain example behaviour and one cannot assume to have seen all possible process executions, process discovery techniques need to be able to handle incompleteness. In this paper, we study the effects of such incomplete logs on process discovery. We analyse the impact of incompleteness of logs on behavioural relations, which are abstractions often used by process discovery techniques. We introduce probabilistic behavioural relations that are less sensitive to incompleteness, and exploit these relations to provide a more robust process discovery algorithm. We prove this algorithm to be able to rediscover a model of the original system. Furthermore, we show in experiments that our approach even rediscovers models from incomplete event logs that are much smaller than required by other process discovery algorithms.

[1]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[2]  Stefanie Rinderle-Ma,et al.  Data-Driven Process Discovery and Analysis - Second IFIP WG 2.6, 2.12 International Symposium, SIMPDA 2012, Campione d'Italia, Italy, June 18-20, 2012, Revised Selected Papers , 2013, SIMPDA.

[3]  Geert Poels,et al.  Enterprise Information Systems of the Future , 2013, Lecture Notes in Business Information Processing.

[4]  Wil M. P. van der Aalst,et al.  Fuzzy Mining - Adaptive Process Simplification Based on Multi-perspective Metrics , 2007, BPM.

[5]  Wolfgang Reisig,et al.  Lectures on Concurrency and Petri Nets , 2003, Lecture Notes in Computer Science.

[6]  BaesensBart,et al.  A multi-dimensional quality assessment of state-of-the-art process discovery algorithms using real-life event logs , 2012 .

[7]  Jussi Vanhatalo,et al.  Simplified Computation and Generalization of the Refined Process Structure Tree , 2010, WS-FM.

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

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

[10]  Jörg Desel,et al.  Application and Theory of Petri Nets and Concurrency , 2013, Lecture Notes in Computer Science.

[11]  Guido Schimm,et al.  Mining Most Specific Workflow Models from Event-Based Data , 2003, Business Process Management.

[12]  Wil M.P. van der Aalst,et al.  Process mining with the HeuristicsMiner algorithm , 2006 .

[13]  Jianmin Wang,et al.  Mining Invisible Tasks from Event Logs , 2007, APWeb/WAIM.

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

[15]  Bernhard Thalheim,et al.  Conceptual Modeling for E-Business and the Web , 2000, Lecture Notes in Computer Science.

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

[17]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[18]  Gianfranco Ciardo,et al.  Applications and Theory of Petri Nets 2005, 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005, Proceedings , 2005, ICATPN.

[19]  Robin Bergenthum,et al.  Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages , 2009, Fundam. Informaticae.

[20]  Sander J. J. Leemans,et al.  Discovering Block-Structured Process Models from Event Logs Containing Infrequent Behaviour , 2013, Business Process Management Workshops.

[21]  Vojtech Huser,et al.  Process Mining: Discovery, Conformance and Enhancement of Business Processes , 2012, J. Biomed. Informatics.

[22]  Guido Schimm.  Process Miner - A Tool for Mining Process Schemes from Event-Based Data , 2002, JELIA.

[23]  Mathias Weske,et al.  Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation , 2011, Fundam. Informaticae.

[24]  Manuel Lazo-Cortés,et al.  Sub-process Discovery: Opportunities for Process Diagnostics , 2012, CONFENIS.

[25]  Mogens Nielsen,et al.  Application and Theory of Petri Nets 2000: 21st International Conference, ICATPN 2000 Aarhus, Denmark, June 26–30, 2000 Proceedings , 2000, ICATPN.

[26]  Matthias Weidlich,et al.  On Profiles and Footprints - Relational Semantics for Petri Nets , 2012, Petri Nets.

[27]  Boudewijn F. van Dongen,et al.  Towards Improving the Representational Bias of Process Mining , 2011, SIMPDA.

[28]  Boudewijn F. van Dongen,et al.  A genetic algorithm for discovering process trees , 2012, 2012 IEEE Congress on Evolutionary Computation.

[29]  Peter Linz,et al.  An Introduction to Formal Languages and Automata , 2011 .

[30]  Wil M. P. van der Aalst,et al.  The Need for a Process Mining Evaluation Framework in Research and Practice , 2007, Business Process Management Workshops.

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

[32]  van der Wmp Wil Aalst,et al.  Evaluating the quality of discovered process models , 2008 .

[33]  A. J. M. M. Weijters,et al.  Flexible Heuristics Miner (FHM) , 2011, 2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).

[34]  Jeffrey Xu Yu,et al.  Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings , 2007, APWeb/WAIM.

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

[36]  Philippe Darondeau,et al.  Region Based Synthesis of P/T-Nets and Its Potential Applications , 2000, ICATPN.

[37]  Bart Baesens,et al.  A multi-dimensional quality assessment of state-of-the-art process discovery algorithms using real-life event logs , 2012, Inf. Syst..

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

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

[40]  Philippe Darondeau,et al.  Unbounded Petri Net Synthesis , 2003, Lectures on Concurrency and Petri Nets.

[41]  Eric Badouel,et al.  On the α-Reconstructibility of Workflow Nets , 2012, Petri Nets.

[42]  Josep Carmona.  Projection approaches to process mining using region-based techniques , 2011, Data Mining and Knowledge Discovery.

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

[44]  Zoltán Ésik,et al.  Free Shuffle Algebras in Language Varieties , 1996, Theor. Comput. Sci..

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

[46]  Guido Schimm.  Generic Linear Business Process Modeling , 2000, ER.

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

[48]  Peter Linz,et al.  An Introduction to Formal Languages and Automata , 1997 .

[49]  Jan Mendling,et al.  Business Process Model Abstraction Based on Synthesis from Well-Structured Behavioral Profiles , 2012, Int. J. Cooperative Inf. Syst..

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

[51]  Wolfgang Reisig,et al.  A Primer in Petri Net Design , 1992, Springer Compass International.

[52]  Eric Badouel.  On the alpha-Reconstructibility of Workflow Nets , 2012 .

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