Verification of workflow nets with transition conditions

Workflow management is concerned with automated support for business processes. Workflow management systems are driven by process models specifying the tasks that need to be executed, the order in which they can be executed, which resources are authorised to perform which tasks, and data that is required for, and produced by, these tasks. As workflow instances may run over a sustained period of time, it is important that workflow specifications be checked before they are deployed. Workflow verification is usually concerned with control-flow dependencies only; however, transition conditions based on data may further restrict possible choices between tasks. In this paper we extend workflow nets where transitions have concrete conditions associated with them, called WTC-nets. We then demonstrate that we can determine which execution paths of a WTC-net that are possible according to the control-flow dependencies, are actually possible when considering the conditions based on data. Thus, we are able to more accurately determine at design time whether a workflow net with transition conditions is sound.

[1]  Bertrand Meyer,et al.  Introduction to the Theory of Programming Languages , 1990 .

[2]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[3]  T. Curran,et al.  SAP R/3 Business Blueprint: Understanding the Business Process Reference Model , 1997 .

[4]  Natalia Sidorova,et al.  Workflow Soundness Revisited: Checking Correctness in the Presence of Data While Staying Conceptual , 2010, CAiSE.

[5]  Wolfram Amme,et al.  Process Restructuring in the Presence of Message-Dependent Variables , 2010, ICSOC Workshops.

[6]  Karsten Wolf.  Using Petri Net Invariants in State Space Construction , 2003, TACAS.

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

[8]  Cesare Tinelli,et al.  DPLL( T): Fast Decision Procedures , 2004, CAV.

[9]  Lori A. Clarke,et al.  A System to Generate Test Data and Symbolically Execute Programs , 1976, IEEE Transactions on Software Engineering.

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

[11]  Mark N. Wegman,et al.  Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.

[12]  Wang Jianmin,et al.  DERIVING CANONICAL BUSINESS OBJECT OPERATION NETS FROM PROCESS MODELS , 2009, ICEIS 2009.

[13]  Jianmin Wang,et al.  Deriving Canonical Business Object Operation Nets from Process Models , 2009, ICEIS.

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

[15]  David A. Padua,et al.  Concurrent Static Single Assignment Form and Constant Propagation for Explicitly Parallel Programs , 1997, LCPC.

[16]  John V. Franco.  Typical case complexity of Satisfiability Algorithms and the threshold phenomenon , 2005, Discret. Appl. Math..

[17]  Amitava Bagchi,et al.  On Detecting Data Flow Errors in Workflows , 2010, JDIQ.

[18]  Wolfram Amme,et al.  Advanced Verification of Distributed WS-BPEL Business Processes Incorporating CSSA-based Data Flow Analysis , 2007, IEEE SCC.

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

[20]  Amitava Bagchi,et al.  Detecting Data Flow Errors in Workflows: A Systematic Graph Traversal Approach , 2007 .

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

[22]  T. Murata,et al.  Petri Nets , 1992, Concise Encyclopedia of Modelling & Simulation.

[23]  Natalia Sidorova,et al.  Soundness verification for conceptual workflow nets with data: Early detection of errors with the most precision possible , 2011, Inf. Syst..

[24]  Wolfram Amme,et al.  A Restructuring Method for WS-BPEL Business Processes Based on Extended Workflow Graphs , 2009, BPM.

[25]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

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

[27]  Rupak Majumdar,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 1997, Lecture Notes in Computer Science.

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

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

[30]  James C. King,et al.  Symbolic execution and program testing , 1976, CACM.

[31]  Sarfraz Khurshid,et al.  Generalized Symbolic Execution for Model Checking and Testing , 2003, TACAS.

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

[33]  Jinjun Chen,et al.  Dual Workflow Nets: Mixed Control/Data-Flow Representation for Workflow Modeling and Verification , 2007, APWeb/WAIM Workshops.

[34]  Shamkant B. Navathe,et al.  Information and Process Integration in Enterprises: Rethinking Documents , 1998 .

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

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

[37]  Hmw Eric Verbeek,et al.  Verification of WF-nets , 2004 .

[38]  Olivia R. Liu Sheng,et al.  Formulating the Data-Flow Perspective for Business Process Management , 2006, Inf. Syst. Res..

[39]  Karsten Schmidt,et al.  Using Petri net invariants in state space construction , 2003 .

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

[41]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

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

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

[44]  Wolfram Amme,et al.  Advanced Verification of Distributed WS-BPEL Business Processes Incorporating CSSA-based Data Flow Analysis , 2007, IEEE International Conference on Services Computing (SCC 2007).

[45]  Vladimiro Sassone,et al.  Petri Nets and Other Models of Concurrency , 1996, Petri Nets.

[46]  Wil M.P. van der Aalst,et al.  Three good reasons for using a Petri-net-based workflow management system , 1996 .

[47]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

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

[49]  Jianmin Wang,et al.  Verifying workflow processes: a transformation-based approach , 2010, Software & Systems Modeling.