Conformance Checking using Formal Methods

Conformance checking is an important process mining task; it aims to detect inconsistencies between the model of a process and its corresponding execution log. This paper proposes an approach in which it is given a declarative description, represented by a set of temporal logic properties, for the process model; the process discovered from the log is described by means of a process algebra, and conformance checking is performed through the model checking of the discovered process against the properties. To discover the process we consider additional information contained in the log and associated with the single events. Moreover, since discovered processes tend, in general, to be very large and complex, we look for a reduced process containing only the parts relevant for the properties satisfaction. In this way we reduce both the space needed for the discovered process and the time complexity for the properties verification.

[1]  Antonella Santone,et al.  GreASE: A Tool for Efficient “Nonequivalence” Checking , 2014, TSEM.

[2]  Wil M. P. van der Aalst,et al.  Conformance checking of processes based on monitoring real behavior , 2008, Inf. Syst..

[3]  Wil M. P. van der Aalst,et al.  Declarative workflows: Balancing between flexibility and support , 2009, Computer Science - Research and Development.

[4]  Wil M.P. van der Aalst,et al.  Process Mining : Extending the α-algorithm to Mine Short Loops , 2004 .

[5]  Roberto Barbuti,et al.  Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems , 1999, J. Comput. Syst. Sci..

[6]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[7]  Edmund M. Clarke,et al.  Model Checking: Software and Beyond , 2007, J. Univers. Comput. Sci..

[8]  Antonella Santone,et al.  Heuristic search for equivalence checking , 2014, Software & Systems Modeling.

[9]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[10]  Wil M. P. van der Aalst,et al.  Enhancing Declare Maps Based on Event Correlations , 2013, BPM.

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

[12]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[13]  Roberto Barbuti,et al.  Reduced Models for Efficient CCS Verification , 2005, Formal Methods Syst. Des..

[14]  Manfred Reichert,et al.  Making Sense of Declarative Process Models: Common Strategies and Typical Pitfalls , 2013, BMMDS/EMMSAD.

[15]  Jan Mendling,et al.  Managing Process Model Complexity Via Abstract Syntax Modifications , 2011, IEEE Transactions on Industrial Informatics.

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

[17]  Boudewijn F. van Dongen,et al.  Process Mining and Verification of Properties: An Approach Based on Temporal Logic , 2005, OTM Conferences.

[18]  Maria Luisa Villani,et al.  Ant Colony Optimization for Deadlock Detection in Concurrent Systems , 2011, 2011 IEEE 35th Annual Computer Software and Applications Conference.

[19]  Wil M. P. van der Aalst,et al.  An alignment-based framework to check the conformance of declarative process models and to preprocess event-log data , 2015, Inf. Syst..