Realizability of Choreographies for Services Interacting Asynchronously

Choreography specification languages describe from a global point of view interactions among a set of services in a system to be designed. Given a choreography specification, the goal is to obtain a distributed implementation of the choreography as a system of communicating peers. These peers can be given as input (e.g., obtained using discovery techniques) or automatically generated by projection from the choreography. Checking whether some set of peers implements a choreography specification is called realizability. This check is in general undecidable if asynchronous communication is considered, that is, services interact through message buffers. In this paper, we consider conversation protocols as a choreography specification language, and leverage a recent decidability result to check automatically the realizability of these specifications by a set of peers under an asynchronous communication model with a priori unbounded buffers.

[1]  Philippe Darondeau,et al.  Quasi-static scheduling of communicating tasks , 2010, Inf. Comput..

[2]  Nobuko Yoshida,et al.  Buffered Communication Analysis in Distributed Multiparty Sessions , 2010, CONCUR.

[3]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[4]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.

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

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

[7]  Andreas Podelski,et al.  ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.

[8]  Xiang Fu,et al.  Towards a Theory of Web Service Choreographies , 2007, WS-FM.

[9]  Anca Muscholl,et al.  A Kleene theorem and model checking algorithms for existentially bounded communicating automata , 2006, Inf. Comput..

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

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

[12]  Niels Lohmann,et al.  Realizability is controllability , 2009, ZEUS.

[13]  Wei Wei,et al.  A Scalable Incomplete Test for Message Buffer Overflow in Promela Models , 2004, SPIN.

[14]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[16]  Andrew D. Gordon,et al.  Verified Reference Implementations of WS-Security Protocols , 2006, WS-FM.

[17]  Samik Basu,et al.  Choreography conformance via synchronizability , 2011, WWW.

[18]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[19]  Parosh Aziz Abdulla,et al.  On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels , 1998, CAV.

[20]  Pascal Fradet,et al.  Adaptor Synthesis for Real-Time Components , 2007, TACAS.

[21]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[22]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[23]  Wei Wei,et al.  A Scalable Incomplete Test for the Boundedness of UML RT Models , 2004, TACAS.

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

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

[26]  Thierry Jéron,et al.  Testing for Unboundedness of FIFO Channels , 1993, Theor. Comput. Sci..

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

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

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

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

[31]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

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