Modeling coordination via asynchronous communication

  • Antonio Brogi
  • Jean-Marie Jacquet
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1282)


The paper proposes a theoretical study of coordination languages. A language that embodies the essential features of coordination languages is considered. The language includes Linda's asynchronous communication primitives, as well as several composition operators. Computations in this language are described by means of an operational semantics, reporting the whole traces of executions. The non-compositionality of this intuitive operational semantics motivates the design of a compositional and fully abstract denotational semantics, can be exploited for studying program equivalence in this setting.


Composition Operator Operational Semantic Atomic Agent Parallel Composition Asynchronous Communication 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Brookes. Full Abstraction for a Shared-Variable Parallel Language. In Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 98–109, Montreal, Canada, June 1993. IEEE Computer Society Press.Google Scholar
  2. 2.
    N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.CrossRefGoogle Scholar
  3. 3.
    N. Carriero and D. Gelernter. Coordination Languages and Their Significance. Communications of the ACM, 35(2):97–107, 1992.CrossRefGoogle Scholar
  4. 4.
    P. Ciancarini and C. Hankin, editors. Proceedings of The First International Conference on Coordination Models and Languages, number 1061 in LNCS. Springer-Verlag, 1996.Google Scholar
  5. 5.
    F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The Failure of Failures in a Paradigm of Asynchronous Communication. In J.C.M. Baeten and J.F. Groote, editors, Proc. 2 nd Int. Conf. on Concurrency Theory (Concur'91), volume 527 of Lecture Notes in Computer Science, pages 111–126, Amsterdam, The Netherlands, 1991. Springer-Verlag.Google Scholar
  6. 6.
    E. Horita, J.W. de Bakker, and J.J.M.M. Rutten. Fully abstract denotational models for nonuiform concurrent languages. Information and computation, 115(1):125–178, 1994.CrossRefGoogle Scholar
  7. 7.
    R. Milner. A Calculus of communucating systems. Springer-Verlag, 1980.Google Scholar
  8. 8.
    R. De Nicola and R. Pugliese. A process algebra based on Linda. In P. Ciancarini and C. Hankin, editors, COORDINATION 96, number 1061 in LNCS. Springer-Verlag, 1996.Google Scholar
  9. 9.
    G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Aarhus University, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Antonio Brogi
    • 1
  • Jean-Marie Jacquet
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly
  2. 2.Institut d'InformatiqueFacultés Universitaires de NamurNamurBelgium

Personalised recommendations