A Full R/I-Net Construct Lexicon for Declare Constraints

Recently, declarative process languages are gaining ground as the procedural way of capturing activities in a fixed work-flow is deemed to be inflexible. Declare, one of the prime languages of the declarative process modeling paradigm, is composed of logic-based activity constraints which are event-driven. In this paper, a template-based conversion is proposed of every Declare constraint into a single Petri net fragment with weighted, reset and inhibitor arcs, i.e. a weighted R/I-net. As such, a formalization of the execution semantics of Declare is obtained, similar to linear temporal logic or regular expressions, but now expressed in the form of Petri nets. Equivalence of Declare constraints and the respective Petri net templates are analyzed at the theoretical level and by means of a simulation experiment.

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

[2]  Wil M.P. van der Aalst,et al.  YAWL: yet another workflow language , 2005, Inf. Syst..

[3]  Dirk Fahland,et al.  Towards Analyzing Declarative Workflows , 2007, Autonomous and Adaptive Web Services.

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

[5]  Hajo A. Reijers,et al.  Declarative Modeling-An Academic Dream or the Future for BPM? , 2013, BPM.

[6]  Moe Thandar Wynn,et al.  Reduction rules for reset/inhibitor nets , 2010, J. Comput. Syst. Sci..

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

[8]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.

[9]  Wil M. P. van der Aalst,et al.  Worklets: A Service-Oriented Implementation of Dynamic Flexibility in Workflows , 2006, OTM Conferences.

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

[11]  Jan Vanthienen,et al.  Declarative business process modelling: principles and modelling languages , 2015, Enterp. Inf. Syst..

[12]  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..

[13]  Wil M. P. van der Aalst,et al.  Making Work Flow: On the Application of Petri Nets to Business Process Management , 2002, ICATPN.

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

[15]  Michael Westergaard,et al.  CPN Tools 4: Multi-formalism and Extensibility , 2013, Petri Nets.

[16]  Alberto Trombetta,et al.  BPMN: An introduction to the standard , 2012, Comput. Stand. Interfaces.

[17]  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).

[18]  Marco Montali,et al.  Runtime Verification of LTL-Based Declarative Process Models , 2011, RV.

[19]  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).

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

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

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

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

[24]  Hajo A. Reijers,et al.  UnconstrainedMiner: Efficient Discovery of Generalized Declarative Process Models , 2013 .

[25]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[26]  A. Sperduti,et al.  User-guided discovery of declarative process models , 2011 .

[27]  Maria E. Orlowska,et al.  Pockets of Flexibility in Workflow Specification , 2001, ER.

[28]  Boudewijn F. van Dongen,et al.  Conformance Checking Using Cost-Based Fitness Analysis , 2011, 2011 IEEE 15th International Enterprise Distributed Object Computing Conference.

[29]  Moe Thandar Wynn,et al.  Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[30]  Wil M. P. van der Aalst,et al.  Genetic process mining: an experimental evaluation , 2007, Data Mining and Knowledge Discovery.

[31]  Wil M. P. van der Aalst,et al.  Formalization and verification of event-driven process chains , 1999, Inf. Softw. Technol..

[32]  Michael Westergaard,et al.  Mixing Paradigms for More Comprehensible Models , 2013, BPM.

[33]  Fabrizio Maria Maggi,et al.  Declare: A Tool Suite for Declarative Workflow Modeling and Enactment , 2011, BPM.

[34]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[35]  Akhil Kumar,et al.  Process Materialization Using Templates and Rules to Design Flexible Process Models , 2009, RuleML.

[36]  Wil M. P. van der Aalst,et al.  Flexibility as a Service , 2009, DASFAA Workshops.