Realizability of Choreographies Using Process Algebra Encodings

Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as collaboration diagrams. In this paper, we present an encoding of collaboration diagrams into the LOTOS process algebra for choreography analysis. This encoding allows us to (1) check the temporal properties of choreographies using a LOTOS verification tool set called the Construction and Analysis of Distributed Processes (CADP) toolbox, (2) check the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and (3) automate the peer generation process. Realizability indicates whether peers can be generated from a given choreography specification in such a way that the interactions of the generated peers exactly match the choreography specification. If a collaboration diagram is unrealizable, our approach extends the peer generation process by adding extra communication that guarantees that the peers behave according to the choreography specification.

[1]  Xiang Fu,et al.  WSAT: A Tool for Formal Analysis of Web Services , 2004, CAV.

[2]  Mihaela Sighireanu,et al.  Efficient on-the-fly model-checking for regular alternation-free mu-calculus , 2003, Sci. Comput. Program..

[3]  Gwen Salaün,et al.  Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques , 2012, IEEE Transactions on Software Engineering.

[4]  Frédéric Lang,et al.  SVL: A Scripting Language for Compositional Verification , 2001, FORTE.

[5]  James Dooley,et al.  A Framework for Dynamic Service Discovery , 2008, 2008 23rd IEEE/ACM International Conference on Automated Software Engineering.

[6]  Tevfik Bultan,et al.  Realizability of Choreographies Using Process Algebra Encodings , 2012, IEEE Transactions on Services Computing.

[7]  Marlon Dumas,et al.  Service Interaction Modeling: Bridging Global and Local Views , 2006, 2006 10th IEEE International Enterprise Distributed Object Computing Conference (EDOC'06).

[8]  Xiang Fu,et al.  Specification of Realizable Service Conversations Using Collaboration Diagrams , 2007, SOCA.

[9]  Chao Cai,et al.  Towards the theoretical foundation of choreography , 2007, WWW '07.

[10]  Jan Mendling,et al.  From Inter-organizational Workflows to Process Execution: Generating BPEL from WS-CDL , 2005, OTM Workshops.

[11]  Rajeev Alur,et al.  Inference of Message Sequence Charts , 2003, IEEE Trans. Software Eng..

[12]  Sebastián Uchitel,et al.  Incremental elaboration of scenario-based specifications and behavior models using implied scenarios , 2004, TSEM.

[13]  Wil M. P. van der Aalst,et al.  Choreography Conformance Checking: An Approach based on BPEL and Petri Nets , 2005, The Role of Business Processes in Service Oriented Architectures.

[14]  Roberto Gorrieri,et al.  Choreography and Orchestration Conformance for System Design , 2006, COORDINATION.

[15]  Nobuko Yoshida,et al.  Structured Communication-Centred Programming for Web Services , 2007, ESOP.

[16]  Raman Kazhamiakin,et al.  Analysis of Realizability Conditions for Web Service Choreographies , 2006, FORTE.

[17]  Xiang Fu,et al.  Synchronizability of conversations among Web services , 2005, IEEE Transactions on Software Engineering.

[18]  Xiang Fu,et al.  Conversation protocols: a formalism for specification and verification of reactive electronic services , 2003, Theor. Comput. Sci..

[19]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[20]  Gwen Salaün.  Generation of Service Wrapper Protocols from Choreography Specifications , 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.

[21]  Radu Mateescu,et al.  CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes , 2007, CAV.

[22]  Gwen Salaün,et al.  Analyzing Chor Specifications by Translation into FSP , 2009, Electron. Notes Theor. Comput. Sci..

[23]  Rajeev Alur,et al.  Realizability and verification of MSC graphs , 2005, Theor. Comput. Sci..

[24]  Li Jing,et al.  Conformance Validation between Choreography and Orchestration , 2007 .

[25]  Francisco Durán,et al.  Checking Protocol Compatibility using Maude , 2009, Electron. Notes Theor. Comput. Sci..