Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs

The Symbolic Observation Graph (SOG) associated with a labelled transition system and a subset of its labels is an efficient BDD-based abstraction representing the behavior of a system. The goal of this paper is to compose SOGs such that the resulting SOG is still small but represents the behavior of the composed business process in an appropriate way. In particular, we would like to deduce the properties of a composed business process by analysing the composition of the SOGs associated with its components. This question was already answered for the deadlock-freeness property in previous work. In this paper, we extend this result to other generic properties: the so-called soundness properties. These properties guarantee the absence of livelocks, deadlocks and other anomalies that can be formulated without domain knowledge. Thus, we show how the SOG can be adapted and used so that the verification of several variants of the soundness property can be performed modularly.

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

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

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

[4]  Winfried Lamersdorf,et al.  Service-Oriented Computing - ICSOC 2006, 4th International Conference, Chicago, IL, USA, December 4-7, 2006, Proceedings , 2006, ICSOC.

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

[6]  Wil M. P. van der Aalst,et al.  Applications and Theory of Petri Nets 2003 , 2003, Lecture Notes in Computer Science.

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

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

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

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

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

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

[13]  Gianfranco Balbo,et al.  Application and Theory of Petri Nets 1997 , 1997 .

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

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

[16]  Kees M. van Hee,et al.  Component-based software architectures: a framework based on inheritance of behavior , 2002, Sci. Comput. Program..

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

[18]  Samir Tata,et al.  Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes , 2011, Data Knowl. Eng..

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

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

[21]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.