Soundness of workflow nets: classification, decidability, and analysis

Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets. We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.

[1]  Wil M. P. van der Aalst,et al.  Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques , 2000, Business Process Management.

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

[3]  Karsten Wolf,et al.  Transforming BPEL to Petri Nets , 2005, Business Process Management.

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

[5]  Dragos Manolescu,et al.  Production workflow: concepts and techniques , 2001, SOEN.

[6]  Ekkart Kindler,et al.  Liveness, Fairness, and Recurrence in Petri Nets , 1999, Inf. Process. Lett..

[7]  Mathias Weske,et al.  A Look Around the Corner: The Pi-Calculus , 2009, Trans. Petri Nets Other Model. Concurr..

[8]  Yannis Smaragdakis,et al.  J-Orchestra: Enhancing Java programs with distribution capabilities , 2009, TSEM.

[9]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[10]  Wil M. P. van der Aalst,et al.  Bridging The Gap Between Business Models And Workflow Specifications , 2004, Int. J. Cooperative Inf. Syst..

[11]  Hao Lin,et al.  A novel graph reduction algorithm to identify structural conflicts , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

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

[13]  Wil M. P. van der Aalst,et al.  Verification Of Workflow Task Structures: A Petri-net-baset Approach , 2000, Inf. Syst..

[14]  Maria E. Orlowska,et al.  Analyzing Process Models Using Graph Reduction Techniques , 2000, Inf. Syst..

[15]  Kees M. van Hee,et al.  Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach , 2003, ICATPN.

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

[17]  Juliane Dehnert.  A methodology for workflow modeling: from business process modeling towards sound workflow specification , 2003 .

[18]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

[19]  Akhil Kumar,et al.  Research Commentary: Workflow Management Issues in e-Business , 2002, Inf. Syst. Res..

[20]  Jeremy Gibbons,et al.  A Process-Algebraic Approach to Workflow Specification and Refinement , 2007, SC@ETAPS.

[21]  Jan Mendling,et al.  From business process models to process-oriented software systems , 2009, TSEM.

[22]  Jan Mendling,et al.  Detection and prediction of errors in EPC business process models , 2007 .

[23]  Gerhard Goos,et al.  Software Composition , 2012, Lecture Notes in Computer Science.

[24]  Moe Thandar Wynn,et al.  Soundness-preserving reduction rules for reset workflow nets , 2009, Inf. Sci..

[25]  W.M.P. van der Aalst,et al.  Analyzing BPEL processes using Petri nets , 2005 .

[26]  Mathias Weske,et al.  Business Process Management: Concepts, Languages, Architectures , 2007 .

[27]  Wolfgang Reisig,et al.  Inter-operability of Workflow Applications: Local Criteria for Global Soundness , 2000, Business Process Management.

[28]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[29]  Kees M. van Hee,et al.  Soundness of Resource-Constrained Workflow Nets , 2005, ICATPN.

[30]  Axel Martens.  On Compatibility of Web Services , 2003 .

[31]  Dirk Fahland,et al.  Instantaneous Soundness Checking of Industrial Business Process Models , 2009, BPM.

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

[33]  Maria E. Orlowska,et al.  Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models , 1999, CAiSE.

[34]  Luca Padovani,et al.  Formal Methods for Web Services , 2009, Lecture Notes in Computer Science.

[35]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[36]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2004, Distributed and Parallel Databases.

[37]  Robert W. Blanning,et al.  A Formal Approach to Workflow Analysis , 2000, Inf. Syst. Res..

[38]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[39]  Frank Leymann,et al.  Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition , 2007, ICSOC.

[40]  Niels Lohmann,et al.  Wendy: A Tool to Synthesize Partners for Services , 2011, Fundam. Informaticae.

[41]  Wil M. P. van der Aalst,et al.  Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Relaxed Soundness and Invariants , 2007, Comput. J..

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

[43]  Wil M. P. van der Aalst,et al.  From Public Views to Private Views - Correctness-by-Design for Services , 2007, WS-FM.

[44]  Jeremy Gibbons,et al.  A Process Semantics for BPMN , 2008, ICFEM.

[45]  Henry H. Bi,et al.  Applying Propositional Logic to Workflow Verification , 2004, Inf. Technol. Manag..

[46]  Jan Mendling,et al.  Faulty EPCs in the SAP Reference Model , 2006, Business Process Management.

[47]  Axel Martens,et al.  Analyzing Web Service Based Business Processes , 2005, FASE.

[48]  Dan C. Marinescu.  Internet Based Workflow Management: Towards a Semantic Web , 2002 .

[49]  MengChu Zhou,et al.  Performance modeling and analysis of workflow , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[50]  Juliane Dehnert,et al.  Relaxed Soundness of Business Processes , 2001, CAiSE.

[51]  Sharon A. White.  Business Process Modeling Notation Specification (Version 1.2, OMG Final Adopted Specification) , 2009 .

[52]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[53]  Piotr Chrzastowski-Wachtel.  Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem , 1999, ICATPN.

[54]  Moe Thandar Wynn,et al.  Achieving a General, Formal and Decidable Approach to the OR-Join in Workflow Using Reset Nets , 2005, ICATPN.

[55]  Karsten Wolf,et al.  Does My Service Have Partners? , 2009, Trans. Petri Nets Other Model. Concurr..

[56]  Mathias Weske,et al.  Investigations on Soundness Regarding Lazy Activities , 2006, Business Process Management.

[57]  Moe Thandar Wynn,et al.  Soundness of Workflow Nets with Reset Arcs , 2009, Trans. Petri Nets Other Model. Concurr..

[58]  Amit P. Sheth,et al.  An overview of workflow management: From process modeling to workflow automation infrastructure , 1995, Distributed and Parallel Databases.

[59]  Boudewijn F. van Dongen,et al.  Verification of EPCs: Using Reduction Rules and Petri Nets , 2005, CAiSE.

[60]  Christoph Bussler,et al.  Workflow Management: Modeling Concepts, Architecture and Implementation , 1996 .

[61]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.

[62]  Wil M. P. van der Aalst,et al.  Service Interaction: Patterns, Formalization, and Analysis , 2009, SFM.

[63]  R. A. van der Toorn,et al.  Component-based software design with Petri nets : an approach based on inheritance of behavior , 2004 .

[64]  Hongyan Ma,et al.  Process-aware information systems: Bridging people and software through process technology , 2007, J. Assoc. Inf. Sci. Technol..

[65]  Serge Haddad,et al.  Application and Theory of Petri Nets , 2012, Lecture Notes in Computer Science.

[66]  Gérard Berthelot,et al.  Checking properties of nets using transformation , 1985, Applications and Theory in Petri Nets.

[67]  Mike Wright,et al.  Petri net-based modelling of workflow systems: An overview , 2001, Eur. J. Oper. Res..

[68]  Maria E. Orlowska,et al.  On Correctness Issues in Conceptual Modelling of Workflows , 1997, ECIS.

[69]  Wil M. P. van der Aalst,et al.  Diagnosing Workflow Processes using Woflan , 2001, Comput. J..

[70]  Moe Thandar Wynn,et al.  Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis , 2006, Business Process Management.

[71]  Xiang Fu,et al.  Analysis of interacting BPEL web services , 2004, WWW '04.

[72]  Kamel Barkaoui,et al.  Structural Analysis of Workflow Nets with Shared Resources , 1998 .

[73]  Dimitra Giannakopoulou,et al.  Model checking of workflow schemas , 2000, Proceedings Fourth International Enterprise Distributed Objects Computing Conference. EDOC2000.

[74]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[75]  Niels Lohmann,et al.  Analyzing Interacting BPEL Processes , 2006, Business Process Management.

[76]  Lars G Fischer.  Workflow Handbook 2002, Workflow Management Coalition , 2002 .

[77]  Philippe Schnoebelen,et al.  Boundedness of Reset P/T Nets , 1999, ICALP.

[78]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[79]  Wil M. P. van der Aalst,et al.  Data-Flow Anti-patterns: Discovering Data-Flow Errors in Workflows , 2009, CAiSE.

[80]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[81]  Javier Esparza.  Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete , 1998, Theor. Comput. Sci..

[82]  W. Brauer,et al.  Advances in Petri nets 1986, part I on Petri nets: central models and their properties , 1987 .

[83]  Kees M. van Hee,et al.  Workflow Management: Models, Methods, and Systems , 2002, Cooperative information systems.

[84]  Xiang Fu,et al.  Formal Verification of e-Services and Workflows , 2002, WES.

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

[86]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2003, Distributed and Parallel Databases.

[87]  Gabriel Juhás,et al.  Instance Deadlock: A Mystery behind Frozen Programs , 2010, Petri Nets.

[88]  Wil M. P. van der Aalst,et al.  An Alternative Way to Analyze Workflow Graphs , 2002, CAiSE.

[89]  Axel Martens,et al.  Consistency between executable and abstract processes , 2005, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service.

[90]  Jörg Desel,et al.  Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) , 2005 .

[91]  Robert Valette,et al.  Application and Theory of Petri Nets 1997 , 1997, Lecture Notes in Computer Science.

[92]  Wil M. P. van der Aalst,et al.  Applications and Theory of Petri Nets , 1983, Informatik-Fachberichte.

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

[94]  Andreas Wombacher.  Decentralized Consistency Checking in Cross-organizationalWorkflows , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[95]  Moe Thandar Wynn,et al.  Reduction rules for reset workflow nets , 2006 .

[96]  Wolfgang Reisig,et al.  An Operating Guideline Approach to the SOA , 2005 .

[97]  Ekkart Kindler,et al.  On the Semantics of EPCs: A Framework for Resolving the Vicious Circle , 2004, Business Process Management.

[98]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[99]  Ekkart Kindler,et al.  On the semantics of EPCs: Resolving the vicious circle , 2006, Data Knowl. Eng..

[100]  Kees M. van Hee,et al.  Generalised Soundness of Workflow Nets Is Decidable , 2004, ICATPN.

[101]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[102]  Jan Mendling,et al.  Detection and prediction of errors in EPCs of the SAP reference model , 2008, Data Knowl. Eng..

[103]  J. Leon Zhao,et al.  Decomposition-Based Verification of Cyclic Workflows , 2005, ATVA.

[104]  Jeremy Gibbons,et al.  Property specifications for workflow modelling , 2009, Sci. Comput. Program..

[105]  Mathias Weske,et al.  Interaction Soundness for Service Orchestrations , 2006, ICSOC.