Workflow Soundness Revisited: Checking Correctness in the Presence of Data While Staying Conceptual

A conceptual workflow model specifies the control flow of a workflow together with abstract data information. This model is later on refined to be executed on an information system. It is desirable that correctness properties of the conceptual workflow would be transferrable to its refinements. In this paper, we present classical workflow nets extended with data operations as a conceptual workflow model. For these nets we develop a novel technique to verify soundness. This technique allows us to conclude whether at least one or any refinement of a conceptual workflow model is sound.

[1]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

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

[3]  Boudewijn F. van Dongen,et al.  ProM 4.0: Comprehensive Support for Real Process Analysis , 2007, ICATPN.

[4]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

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

[6]  Yassine Lakhnech,et al.  Incremental Verification by Abstraction , 2001, TACAS.

[7]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

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

[9]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[10]  Jetty Kleijn,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings , 2007, ICATPN.

[11]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[12]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[13]  Wolfram Amme,et al.  Generic CSSA-Based Pattern over Boolean Data for an Improved WS-BPEL to Petri Net Mappping , 2008, 2008 Third International Conference on Internet and Web Applications and Services.

[14]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[15]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

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

[17]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

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

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

[20]  Orna Grumberg,et al.  Monotonic Abstraction-Refinement for CTL , 2004, TACAS.

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