Incremental Construction of Realizable Choreographies

This paper proposes a correct-by-construction method to build realizable choreographies described using conversation protocols (\( CP \)s). We define a new language consisting of an operators set for incremental construction of CPs. We suggest an asynchronous model described with the Event-B method and its refinement strategy, ensuring the scalability of our approach.

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

[2]  Yamine Aït Ameur,et al.  Towards correct Evolution of Conversation Protocols , 2016, VECoS.

[3]  Anish Athalye.  CoqIOA : a formalization of IO automata in the Coq proof assistant , 2017 .

[4]  Farah Zoubeyr,et al.  A correct-by-construction model for asynchronously communicating systems , 2016, International Journal on Software Tools for Technology Transfer.

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

[6]  Cliff B. Jones,et al.  RODIN (Rigorous Open Development Environment for Complex Systems) , 2005 .

[7]  T. Bultan.  Modeling Interactions of Web Software , 2006, 2nd International Workshop on Automated Specification and Verification of Web Systems (WWV'06).

[8]  Jean-Raymond Abrial,et al.  Modeling in event-b - system and software engineering by Jean-Raymond Abrial , 2010, SOEN.

[9]  Marc Pantel,et al.  Correct Instantiation of a System Reconfiguration Pattern: A Proof and Refinement-Based Approach , 2016, 2016 IEEE 17th International Symposium on High Assurance Systems Engineering (HASE).

[10]  Yamine Aït Ameur,et al.  Correct-by-Construction Evolution of Realisable Conversation Protocols , 2016, MEDI.

[11]  Mathias Weske,et al.  Local Enforceability in Interaction Petri Nets , 2007, BPM.

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

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

[14]  Tobias Nipkow,et al.  Combining Model Checking and Deduction for I/O-Automata , 1995, TACAS.

[15]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

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

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

[18]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[19]  Samik Basu,et al.  Deciding choreography realizability , 2012, POPL '12.

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