On Synchronous and Asynchronous Mobile Processes

  • Paola Quaglia
  • David Walker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1784)

Abstract

This paper studies the relationship between synchronous and asynchronous mobile processes, in the setting of the π-calculus. A type system for processes of the asynchronous monadic subcalculus is introduced and used to obtain a full-abstraction result: two processes of the polyadic π-calculus are typed barbed congruent iff their translations into the subcalculus are asynchronous-monadic-typed barbed congruent.

References

  1. [Bor98]
    M. Boreale. On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science, 195(2):205–226, 1998.MATHCrossRefMathSciNetGoogle Scholar
  2. [Bou92]
    G. Boudol. Asynchrony and the π-calculus (note). Rapports de Recherche 1702, INRIA Sophia Antipolis, 1992.Google Scholar
  3. [Fou98]
    C. Fournet. The Join-Calculus: a Calculus for Distributed Mobile Programming. Thesis École Polytechnique 1998.Google Scholar
  4. [FG96]
    C. Fournet and G. Gonthier. The reflexive chemical machine and the joincalculus. In Proc. 23rd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 372–385, 1996.Google Scholar
  5. [FM97]
    C. Fournet and L. Maranget. The join-calculus language. http://join.inria.fr.
  6. [Hon93]
    K. Honda. Types for Dyadic Interaction. In Proc. CONCUR’93, 509–523. Springer 1993.Google Scholar
  7. [HT91]
    K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In P. America, editor, Proc. European Conference on Object-Oriented Programming, ECOOP’ 91. Springer 1991.Google Scholar
  8. [KPT96]
    N. Kobayashi and B. Pierce and D. Turner. Linearity and the Pi-Calculus. In Proc. 23rd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 358–371, 1996.Google Scholar
  9. [MS98]
    M. Merro and D. Sangiorgi. On asynchrony in name-passing calculi. In Proc. 25th International Colloquium ICALP’98. Springer 1998.Google Scholar
  10. [Mil89]
    R. Milner. Communication and Concurrency. Prentice Hall 1989.Google Scholar
  11. [Mil91]
    R. Milner. The Polyadic π-Calculus: a Tutorial. In Logic and Algebra of Specification, Springer 1992, 203–246.Google Scholar
  12. [Mil99]
    R. Milner. Communicating and mobile systems: the π -calculus. CUP 1999.Google Scholar
  13. [MPW92]
    R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Part I and II. Information and Computation, 100(1):1–77, 1992.MATHCrossRefMathSciNetGoogle Scholar
  14. [Nes97]
    U. Nestmann. What is a ‘Good’ Encoding of Guarded Choice? In Proc. EXPRESS’97, Electronic Lecture Notes in Computer Science, vol. 7, 1997.Google Scholar
  15. [NP96]
    U. Nestmann and B. Pierce. Decoding Choice Encodings. In Proc. International Conference on Concurrency Theory CONCUR’96, 179–194. Springer 1996.Google Scholar
  16. [Pal97]
    C. Palamidessi. Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus. In Proc. 24th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 256–265, 1997.Google Scholar
  17. [PS96]
    B. Pierce and D. Sangiorgi. Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science 6(5), 409–454, 1996.MATHMathSciNetGoogle Scholar
  18. [PS97]
    B. Pierce and D. Sangiorgi. Behavioral Equivalence in the Polymorphic Pi-Calculus. In Proc. 24th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 1997.Google Scholar
  19. [PT97]
    B. Pierce and D. Turner. Pict: A Programming Language Based on the Pi-Calculus. Indiana University technical report 1997.Google Scholar
  20. [QW98]
    P. Quaglia and D. Walker. On Encoding in . In Proc. 18th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS’ 98, 42–53. Springer, 1998.Google Scholar
  21. [San97]
    D. Sangiorgi. The name discipline of uniform receptiveness. In Proc. 24th International Colloquium ICALP’97, 303–313. Springer 1997.Google Scholar
  22. [Tur96]
    D. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh 1996.Google Scholar
  23. [Yos96]
    N. Yoshida. Graph Types for Monadic Mobile Processes. In Proc. 17th Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS’ 97, 371–386. Springer, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Paola Quaglia
    • 1
  • David Walker
    • 2
  1. 1.Aethra TelecomunicazioniItaly
  2. 2.Oxford University Computing LaboratoryUK

Personalised recommendations