Advertisement

Global Consensus through Local Synchronization

  • Sung-Shik T. Q. Jongmans
  • Farhad Arbab
Part of the Communications in Computer and Information Science book series (CCIS, volume 393)

Abstract

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.

Keywords

Product Operator Lemma State Global Consensus Local Synchronization Coordination Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arbab, F.: Reo: a channel-based coordination model for component composition. MSCS 14(3), 329–366 (2004)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Arbab, F.: Puff, The Magic Protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 169–206. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Clarke, D., Proença, J.: Partial Connector Colouring. In: Sirjani, M. (ed.) COORDINATION 2012. LNCS, vol. 7274, pp. 59–73. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  4. 4.
    Jongmans, S.S., Arbab, F.: Modularizing and Specifying Protocols among Threads. In: Proceedings of PLACES 2012. EPTCS. CoRR, vol. 109, pp. 34–45 (2013)Google Scholar
  5. 5.
    Jongmans, S.S., Clarke, D., Proença, J.: A Procedure for Splitting Processes and its Application to Coordination. In: Proceedings of FOCLASA 2012. EPTCS. CoRR, vol. 91, pp. 79–96 (2012)Google Scholar
  6. 6.
    Jongmans, S.S., Santini, F., Sargolzaei, M., Arbab, F., Afsarmanesh, H.: Automatic Code Generation for the Orchestration of Web Services with Reo. In: De Paoli, F., Pimentel, E., Zavattaro, G. (eds.) ESOCC 2012. LNCS, vol. 7592, pp. 1–16. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Proença, J., Clarke, D., De Vink, E., Arbab, F.: Dreams: a framework for distributed synchronous coordination. In: Proceedings of SAC 2012, pp. 1510–1515. ACM (2012)Google Scholar
  8. 8.
    Proença, J.: Synchronous Coordination of Distributed Components. PhD thesis, Leiden University (2011)Google Scholar
  9. 9.
    Proença, J., Clarke, D., De Vink, E., Arbab, F.: Decoupled execution of synchronous coordination models via behavioural automata. In: Proceedings of FOCLASA 2011. EPTCS. CoRR, vol. 58, pp. 65–79 (2011)Google Scholar
  10. 10.
    Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. SCP 61(2), 75–113 (2006)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Jongmans, S.S., Arbab, F.: Overview of Thirty Semantic Formalisms for Reo. SACS 22(1), 201–251 (2012)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Koehler, C., Clarke, D.: Decomposing Port Automata. In: Proceedings of SAC 2009, pp. 1369–1373. ACM (2009)Google Scholar
  13. 13.
    Jongmans, S.S., Arbab, F.: Global Consensus through Local Synchronization (Technical Report). Technical Report FM-1303, CWI (2013)Google Scholar
  14. 14.
    Kokash, N., Changizi, B., Arbab, F.: A Semantic Model for Service Composition with Coordination Time Delays. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 106–121. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. 15.
    Bravetti, M., Zavattaro, G.: Towards a Unifying Theory for Choreography Conformance and Contract Compliance. In: Lumpe, M., Vanderperren, W. (eds.) SC 2007. LNCS, vol. 4829, pp. 34–50. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  16. 16.
    Bravetti, M., Zavattaro, G.: Contract Compliance and Choreography Conformance in the Presence of Message Queues. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 37–45. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    Fu, X., Bultan, T., Su, J.: Conversation protocols: a formalism for specification and verification of reactive electronic services. TCS 328(1-2), 19–37 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Fu, X., Bultan, T., Su, J.: Realizability of Conversation Protocols with Message Contents. IJWSR 2(4), 68–93 (2005)Google Scholar
  19. 19.
    Carbone, M., Honda, K., Yoshida, N.: Structured Communication-Centered Programming for Web Services. TOPLAS 34(2), 8:1–8:78 (2012)Google Scholar
  20. 20.
    Honda, K., Yoshida, N., Carbone, M.: Multiparty Asynchronous Session Types. In: Proceedings of POPL 2008, pp. 273–284. ACM (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sung-Shik T. Q. Jongmans
    • 1
  • Farhad Arbab
    • 1
  1. 1.Centrum Wiskunde and InformaticaAmsterdamThe Netherlands

Personalised recommendations