Specification of Realizable Service Conversations Using Collaboration Diagrams

Specification, modeling and analysis of interactions among peers that communicate via messages are becoming increasingly important due to the emergence of service oriented computing. Collaboration diagrams provide a convenient visual model for specifying such interactions. An interaction among a set of peers can be characterized as a conversation, the global sequence of messages exchanged among the peers, listed in the order they are sent. A collaboration diagram can be used to specify the set of allowable conversations among the peers participating to a composite web service. Specification of interactions from such a global perspective leads to the realizability problem: Is it possible to construct a set of peers that generate exactly the specified conversations? In this paper we investigate the realizability of conversations specified by collaboration diagrams. We formalize the realizability problem by modeling peers as concurrently executing finite state machines and we give sufficient realizability conditions for a class of collaboration diagrams.

[1]  H. Van Dyke Parunak,et al.  Visualizing Agent Conversations: Using Enhanced Dooley Graphs for Agent Design and Analysis , 1996 .

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

[3]  M. Brian Blake,et al.  A Lightweight Software Design Process for Web Services Workflows , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[4]  Sebastián Uchitel,et al.  Model-based verification of Web service compositions , 2003, 18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings..

[5]  Munindar P. Singh.  Synthesizing Coordination Requirements for Heterogeneous Autonomous Agents , 2000, Autonomous Agents and Multi-Agent Systems.

[6]  Quan Z. Sheng,et al.  The Self-Serv Environment for Web Services Composition , 2003, IEEE Internet Comput..

[7]  Xiang Fu,et al.  Conversation specification: a new approach to design and analysis of e-service composition , 2003, WWW '03.

[8]  Sjouke Mauw,et al.  Message Sequence Chart (MSC) , 1996 .

[9]  Xiang Fu,et al.  Realizability of Conversation Protocols with Message Contents , 2005, Int. J. Web Serv. Res..

[10]  Rajeev Alur,et al.  Inference of message sequence charts , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[11]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

[12]  H. Van Dyke Parunak,et al.  Representing Agent Interaction Protocols in UML , 2000, AOSE.

[13]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

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

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

[16]  D. Skogan,et al.  Web service composition in UML , 2004 .

[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]  Nenad Ivezic,et al.  Automating supply-chain management , 2002, AAMAS '02.