Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes

The design of complex inter-enterprise business processes (IEBP) is generally performed in a modular way. Each process is designed separately and then the whole IEBP is obtained by composition. Even if such a modular approach is intuitive and facilitates the design problem, it poses the problem that correct behavior of each business process of the IEBP taken alone does not guarantee a correct behavior of the composed IEBP (i.e. properties are not preserved by composition). Proving correctness of the (unknown) composed process is strongly related to the model checking problem of a system model. Among others, the symbolic observation graph based approach has proven to be very helpful for efficient model checking in general. Since it is heavily based on abstraction techniques and thus hides detailed information about system components that are not relevant for the correctness decision, it is promising to transfer this concept to the problem raised in this paper: How can the symbolic observation graph technique be adapted and employed for process composition? Answering this question is the aim of this paper.

[1]  Niels Lohmann,et al.  Analyzing interacting WS-BPEL processes using flexible model generation , 2008, Data Knowl. Eng..

[2]  Karl Aberer,et al.  CrossFlow: Cross-Organizational Workflow Management in Dynamic Virtual Enterprises , 2000 .

[3]  Wil M. P. van der Aalst,et al.  Loosely coupled interorganizational workflows: : modeling and analyzing workflows crossing organizational boundaries , 2000, Inf. Manag..

[4]  Wolffried Stucky,et al.  A Formal Foundation for Workflow Composition, Workflow View Definition, and Workflow Normalization based on Petri Nets , 2005, APCCM.

[5]  Xiang Fu,et al.  Analyzing conversations of Web services , 2006, IEEE Internet Computing.

[6]  Chun Ouyang,et al.  Comparing and evaluating Petri net semantics for BPEL , 2009, Int. J. Bus. Process. Integr. Manag..

[7]  Samir Tata,et al.  Symbolic Abstraction and Deadlock-Freeness Verification of Inter-enterprise Processes , 2009, BPM.

[8]  Axel Martens,et al.  Simulation and Equivalence between BPEL Process Models , 2005 .

[9]  Laure Petrucci,et al.  Modular construction of the symbolic observation graph , 2008, 2008 8th International Conference on Application of Concurrency to System Design.

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

[11]  Axel Martens,et al.  Usability of Web services , 2003, Fourth International Conference on Web Information Systems Engineering Workshops, 2003. Proceedings..

[12]  Simon Moser,et al.  Analyzing Compatibility of BPEL Processes , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[13]  Daniela Grigori,et al.  Behavioral matchmaking for service retrieval , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[14]  Kais Klai,et al.  MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs , 2008, Petri Nets.

[15]  Remco M. Dijkman,et al.  Semantics and analysis of business process models in BPMN , 2008, Inf. Softw. Technol..

[16]  Kais Klai,et al.  Design and Evaluation of a Symbolic and Abstraction-Based Model Checker , 2004, ATVA.

[17]  Juliane Siegeris,et al.  Workflow Model Compositions Preserving Relaxed Soundness , 2006, Business Process Management.

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

[19]  Mathias Weske,et al.  The P2P Approach to Interorganizational Workflows , 2001, CAiSE.

[20]  Niels Lohmann,et al.  Petrifying Operating Guidelines for Services , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

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

[22]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[23]  Karsten Wolf,et al.  An Algorithm for Matching Nondeterministic Services with Operating Guidelines , 2006 .

[24]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[25]  Wil M. P. van der Aalst,et al.  Inheritance of Interorganizational Workflows: How to Agree to Disagree Without Loosing Control? , 2003, Inf. Technol. Manag..

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

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

[28]  Andries van Dijk.  Contracting Workflows and Protocol Patterns , 2003, Business Process Management.