Global Consensus through Local Synchronization

Coordination languages have emerged for the specification and implementation of interaction protocols among concurrent entities. Currently, we are developing a code generator for one such a language, based on the formalism of constraint automata (CA). As part of the compilation process, our tool computes the CA-specific synchronous product of a number of CA, each of which models a constituent of the protocol to generate code for. This ensures that implementations of those CA at run-time reach a consensus about their global behavior in every step. However, using the existing product operator on CA can be practically problematic. In this paper, we provide a solution by defining a new, local product operator on CA that avoids those problems. We then identify a sufficiently large class of CA for which using our new product instead of the existing one is semantics-preserving.

[1]  Mario Bravetti,et al.  Contract Compliance and Choreography Conformance in the Presence of Message Queues , 2008, WS-FM.

[2]  Farhad Arbab,et al.  Modularizing and Specifying Protocols among Threads , 2013, PLACES.

[3]  Farhad Arbab,et al.  Global Consensus through Local Synchronization (Technical Report) , 2013 .

[4]  Farhad Arbab,et al.  Overview of Thirty Semantic Formalisms for Reo , 2012, Sci. Ann. Comput. Sci..

[5]  Xiang Fu,et al.  Realizability of conversation protocols with message contents , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

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

[7]  Dave Clarke,et al.  A Procedure for Splitting Processes and its Application to Coordination , 2012, FOCLASA.

[8]  Farhad Arbab,et al.  Automatic Code Generation for the Orchestration of Web Services with Reo , 2012, ESOCC.

[9]  Nobuko Yoshida,et al.  Structured Communication-Centered Programming for Web Services , 2007, TOPL.

[10]  Dave Clarke,et al.  Partial Connector Colouring , 2012, COORDINATION.

[11]  Farhad Arbab,et al.  A Semantic Model for Service Composition with Coordination Time Delays , 2010, ICFEM.

[12]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[13]  José Proença,et al.  Synchronous Coordination of Distributed Components , 2011 .

[14]  Erik P. de Vink,et al.  Decoupled execution of synchronous coordination models via behavioural automata , 2011, FOCLASA.

[15]  Dave Clarke,et al.  Decomposing port automata , 2009, SAC '09.

[16]  Farhad Arbab,et al.  Puff, The Magic Protocol , 2011, Formal Modeling: Actors, Open Systems, Biological Systems.

[17]  Mario Bravetti,et al.  Towards a Unifying Theory for Choreography Conformance and Contract Compliance , 2007, SC@ETAPS.

[18]  Christel Baier,et al.  Modeling component connectors in Reo by constraint automata , 2004, Sci. Comput. Program..

[19]  Erik P. de Vink,et al.  Dreams: a framework for distributed synchronous coordination , 2012, SAC '12.