Incorporating negative information to process discovery of complex systems

The discovery of a formal process model from event logs describing real process executions is a challenging problem that has been studied from several angles. Most of the contributions consider the extraction of a model as a one-class supervised learning problem where only a set of process instances is available. Moreover, the majority of techniques cannot generate complex models, a crucial feature in some areas like manufacturing. In this paper we present a fresh look at process discovery where undesired process behaviors can also be taken into account. This feature may be crucial for deriving process models which are less complex, fitting and precise, but also good on generalizing the right behavior underlying an event log. The technique is based on the theory of convex polyhedra and satisfiability modulo theory (SMT) and can be combined with other process discovery approach as a post processing step to further simplify complex models. We show in detail how to apply the proposed technique in combination with a recent method that uses numerical abstract domains. Experiments performed in a new prototype implementation show the effectiveness of the technique and the ability to be combined with other discovery techniques.

[1]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[2]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[3]  Josep Carmona,et al.  Incorporating Negative Information in Process Discovery , 2015, BPM.

[4]  Josep Carmona,et al.  Log-Based Simplification of Process Models , 2015, BPM.

[5]  Wil M. P. van der Aalst,et al.  Finding Structure in Unstructured Processes: The Case for Process Mining , 2007, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007).

[6]  Dirk Fahland,et al.  Simplifying discovered process models in a controlled manner , 2013, Inf. Syst..

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

[8]  Evelina Lamma,et al.  Applying Inductive Logic Programming to Process Mining , 2007, ILP.

[9]  Boudewijn F. van Dongen,et al.  Measuring precision of modeled behavior , 2015, Inf. Syst. E Bus. Manag..

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

[11]  Bart Baesens,et al.  Robust Process Discovery with Artificial Negative Events , 2009, J. Mach. Learn. Res..

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

[13]  Josep Carmona,et al.  New Region-Based Algorithms for Deriving Bounded Petri Nets , 2010, IEEE Transactions on Computers.

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

[15]  Manuel Silva Suárez,et al.  Improving the linearly based characterization of P/T nets , 1991, Applications and Theory of Petri Nets.

[16]  Jan Mendling,et al.  Understanding the Occurrence of Errors in Process Models Based on Metrics , 2007, OTM Conferences.

[17]  Josep Carmona,et al.  Light Region-based Techniques for Process Discovery , 2011, Fundam. Informaticae.

[18]  Josep Carmona,et al.  Unfolding-Based Process Discovery , 2015, ATVA.

[19]  Diogo R. Ferreira,et al.  An Integrated Life Cycle for Workflow Management Based on Learning and Planning , 2006, Int. J. Cooperative Inf. Syst..

[20]  Wil M. P. van der Aalst,et al.  A Rule-Based Approach for Process Discovery: Dealing with Noise and Imbalance in Process Logs , 2005, Data Mining and Knowledge Discovery.

[21]  Glynn Winskel,et al.  The unfolding of general Petri nets , 2008, FSTTCS.

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

[23]  Evelina Lamma,et al.  Inducing Declarative Logic-Based Models from Labeled Traces , 2007, BPM.

[24]  Josep Carmona,et al.  Process Discovery Algorithms Using Numerical Abstract Domains , 2014, IEEE Transactions on Knowledge and Data Engineering.

[25]  Bart Baesens,et al.  Determining Process Model Precision and Generalization with Weighted Artificial Negative Events , 2014, IEEE Transactions on Knowledge and Data Engineering.

[26]  Evelina Lamma,et al.  Verifiable agent interaction in abductive logic programming: The SCIFF framework , 2008, TOCL.

[27]  Manuel Silva Suárez,et al.  Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems , 1996, Petri Nets.