Generating Event Logs Through the Simulation of Declare Models

In the process mining field, several techniques have been developed during the last years, for the discovery of declarative process models from event logs. This type of models describes processes on the basis of temporal constraints. Every behavior that does not violate such constraints is allowed, and such characteristic has proven to be suitable for representing highly flexible processes. One way to test a process discovery technique is to generate an event log by simulating a process model, and then verify that the process discovered from such a log matches the original one. For this reason, a tool for generating event logs starting from declarative process models becomes vital for the evaluation of declarative process discovery techniques. In this paper, we present an approach for the automated generation of event logs, starting from process models that are based on Declare, one of the most used declarative modeling languages in the process mining literature. Our framework bases upon the translation of Declare constraints into regular expressions and on the utilization of Finite State Automata for the simulation. An evaluation of the implemented tool is presented, showing its effectiveness in both the generation of new logs and the replication of the behavior of existing ones. The presented evaluation also shows the capability of the tool of generating very large logs in a reasonably small amount of time, and its integration with state-of-the-art Declare modeling and discovery tools.

[1]  Massimo Mecella,et al.  A two-step fast algorithm for the automated discovery of declarative workflows , 2013, 2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).

[2]  Wil M. P. van der Aalst,et al.  Efficient Discovery of Understandable Declarative Process Models from Event Logs , 2012, CAiSE.

[3]  Giuseppe De Giacomo,et al.  Linear Temporal Logic and Linear Dynamic Logic on Finite Traces , 2013, IJCAI.

[4]  Ákos Horváth,et al.  A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation , 2008, ICGT.

[5]  Marco Montali,et al.  Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness , 2014, AAAI.

[6]  August-Wilhelm Scheer,et al.  ARIS Toolset: A Software Product is Born , 1994, Inf. Syst..

[7]  Fabrizio Maria Maggi Declarative Process Mining with the Declare Component of ProM , 2013, BPM.

[8]  W. M. P. V. D. Aalsta,et al.  YAWL : yet another workflow language , 2015 .

[9]  Jan Mendling,et al.  Imperative versus Declarative Process Modeling Languages: An Empirical Investigation , 2011, Business Process Management Workshops.

[10]  Jan Mendling,et al.  The Effect of Noise on Mined Declarative Constraints , 2013, SIMPDA.

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

[12]  Zheng Liu,et al.  Generating Benchmarks by Random Stepwise Refinement of Petri Nets , 2010, ACSD/Petri Nets Workshops.

[13]  Alessandro Sperduti,et al.  PLG: A Framework for the Generation of Business Process Models and Their Execution Logs , 2010, Business Process Management Workshops.

[14]  Cw Christian Günther,et al.  Process mining: Using CPN tools to create test logs for mining algorithms , 2005 .

[15]  Evelina Lamma,et al.  Exploiting Inductive Logic Programming Techniques for Declarative Process Mining , 2009, Trans. Petri Nets Other Model. Concurr..

[16]  Michael Westergaard,et al.  CPN Tools 4: A Process Modeling Tool Combining Declarative and Imperative Paradigms , 2013, BPM.

[17]  Jan Mendling,et al.  Discovering Target-Branched Declare Constraints , 2014, BPM.

[18]  Fabrizio Maria Maggi,et al.  Using Discriminative Rule Mining to Discover Declarative Process Models with Non-atomic Activities , 2014, RuleML.

[19]  Jan Mendling,et al.  Declarative versus Imperative Process Modeling Languages: The Issue of Understandability , 2009, BMMDS/EMMSAD.

[20]  Seymour Ginsburg,et al.  Preservation of Languages by Transducers , 1966, Inf. Control..

[21]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[22]  Lars Michael Kristensen,et al.  Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems , 2007, International Journal on Software Tools for Technology Transfer.

[23]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[24]  Wil M. P. van der Aalst,et al.  A Declarative Approach for Flexible Business Processes Management , 2006, Business Process Management Workshops.

[25]  B. F. van Dongen BPI Challenge 2014 , 2014 .

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

[27]  Tiziana Catarci,et al.  MailOfMine - Analyzing Mail Messages for Mining Artful Collaborative Processes , 2011, SIMPDA.

[28]  Massimo Mecella,et al.  On the Discovery of Declarative Control Flows for Artful Processes , 2015, ACM Trans. Manag. Inf. Syst..

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

[30]  Boudewijn F. van Dongen,et al.  XES, XESame, and ProM 6 , 2010, CAiSE Forum.

[31]  Wil M. P. van der Aalst,et al.  DECLARE: Full Support for Loosely-Structured Processes , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[32]  Claudio Di Ciccio,et al.  Knowledge-Intensive Processes: Characteristics, Requirements and Analysis of Contemporary Approaches , 2015, Journal on Data Semantics.

[33]  August-Wilhelm Scheer,et al.  ARIS Architecture and Reference Models for Business Process Management , 2000, Business Process Management.

[34]  Wil M. P. van der Aalst,et al.  DecSerFlow: Towards a Truly Declarative Service Flow Language , 2006, WS-FM.

[35]  Wil M. P. van der Aalst,et al.  Configurable Declare: Designing Customisable Flexible Process Models , 2012, OTM Conferences.

[36]  Jan Mendling,et al.  From Declarative Processes to Imperative Models , 2014, SIMPDA.