Advertisement

Expressiveness of point-to-point versus broadcast communications

  • Cristian Ene
  • Traian Muntean
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1684)

Abstract

In this paper we address the problem of the expressive po- wer of point-to-point communication to implement broadcast communication. We demonstrate that point-to-point communication as in CCS [M89] is “too asynchronous” to implement broadcast communication as in CBS [P95]. Milner’s π-calculus [M91] is a calculus in which all communications are point-to-point. We introduce bπ-calculus, using broadcast instead of rendez-vous primitive communication, as a variant of value-passing CBS in which communications are made on channels as in Hoare’s CSP [H85] — and channels can be transmitted too as in π-calculus — but by a broadcast protocol: processes speak one at a time and are heard instantaneously by all others. In this paper, using the fact that π-calculus enjoys a certain interleaving property, whereas bπ-calculus does not, we prove that there does not exist any uniform, parallel-preserving translation from bπ-calculus into π-calculus, up to any “reasonable” equivalence. Using arguments similar to [P97], we also prove a separation result between CBS and CCS.

Keywords

Output Action Electoral System Operational Semantic Label Transition System Broadcast Protocol 
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. [EM99]
    C. Ene and T. Muntean: A distributed calculus for nomadic processes. submitted, 1999.Google Scholar
  2. [HR95]
    M. Hennessy and J. Rathke: Bisimulations for a Calculus of Broadcasting Systems. In I. Lee and S. Smolka, editors, Proceedings of CONCUR 95, Philadelphia, (1995) Lecture Notes in Computer Science 962, Springer-Verlag 486–500.Google Scholar
  3. [H85]
    C. A. R. Hoare: Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  4. [H93]
    U. Holmer: Interpreting Broadcast Communication in SCCS. In Proceedings of CONCUR 93, (1993) Lecture Notes in Computer Science 715, Springer-Verlag.Google Scholar
  5. [M89]
    R. Milner: Communication and concurrency. Prentice-Hall, 1989.Google Scholar
  6. [M91]
    R. Milner: The Polyadic π-Calculus: A Tutorial. In Friedrich L. Bauer and Wilfried Brauer and Helmut Schwichtenberg, editors, (1995) Logic and Algebra of Specification 94. Available as Technical Report ECS-LFCS-91-180, University of Edinburgh, October 1991.Google Scholar
  7. [MPW92]
    R. Milner and J. Parrow and D. Walker: A Calculus of Mobile Processes, Part I/II. Journal of Information and Computation 100 (1992) 1–77.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [P97]
    Catuscia Palamidessi: Comparing the Expressive Power of the Synchronous the Asynchronous π-calculus. In Proceedings of POPL 1997 (ACM, Jan. 1997) 256–265.Google Scholar
  9. [P95]
    K. V. S. Prasad: A Calculus of Broadcasting Systems. (1995) Science of Computer Programming 25.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Cristian Ene
    • 1
    • 2
  • Traian Muntean
    • 1
  1. 1.Laboratoire d'Informatique de Marseille (LIM-CNRS)University of MarseilleMarseilleFrance
  2. 2.Faculty of Computer ScienceUniversity “Al. I. Cuza”IasiRomania

Personalised recommendations