Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On asynchrony in name-passing calculi

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

Abstract

We study an asynchronous π-calculus, called Local π (Lπ), where: (a) only the output capability of names may be transmitted; (b) there is no matching or similar constructs. We study the basic operational and algebraic theory of Lπ and show some applications: the derivability of delayed input; the correctness of an optimisation of the encoding of call-by-name λ-calculus; the validity of some laws for the Join-calculus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. Proofs as Processes. Theoretical Computer Science, 135(1):5–9, December 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In Proc. CONCUR '96, LNCS 1119, Springer Verlag, 1996.

    Google Scholar 

  3. G. Bellin and P. Scott. On the π-calculus and Linear Logic. Theoretical Computer Science, 135(1):11–65, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Boreale. On the expressiveness of internal mobility in name-passing calculi. In Proc. CONCUR '96, LNCS 1119, Springer Verlag, 1996.

    Google Scholar 

  5. M. Boreale, C. Fournet, and C. Laneve. Bisimulations for the Join Calculus. Proc. IFIP Conference PROCOMET'98, 1997.

    Google Scholar 

  6. M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. To appear in Proc. LICS'98, IEEE Computer Society Press., 1998.

    Google Scholar 

  7. G. Boudol. Some Chemical Abstract Machines. LNCS 803, Springer Verlag, 1994.

    Google Scholar 

  8. G. Boudol. The pi-calculus in direct style. In 24th POPL. ACM Press, 1997.

    Google Scholar 

  9. Fournet C. and Gonthier G. The Reflexive Chemical Abstract Machine and the Join calculus. In Proc. 23th POPL. ACM Press, 1996.

    Google Scholar 

  10. Y. Fu. A proof theoretical approach to communication. In 24th ICALP, LNCS 1256, Springer Verlag, 1997.

    Google Scholar 

  11. M. Hansen, H. Hüttel, and J. Kleist. Bisimulations for asynchronous mobile processes. In Proc. Tbilisi Symposium on Language, Logic, and Computation, 1996. Also available as BRICS Report No. EP-95-HHK, BRICS, Aalborg.

    Google Scholar 

  12. K. Honda and M. Tokoro. A Small Calculus for Concurrent Objects. In OOPS Messanger, Association for Computing Machinery. 2(2):50–54, 1991.

    Google Scholar 

  13. K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Proc. ECOOP'91, LNCS 512, Springer Verlag, 1991.

    Google Scholar 

  14. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437–486, 1995.

    Article  MathSciNet  Google Scholar 

  15. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991.

    Google Scholar 

  16. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, 19th ICALP, LNCS 623, Springer Verlag, 1992.

    Google Scholar 

  18. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. To appear in Proc. LICS'98, IEEE CSP, 1998.

    Google Scholar 

  19. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press.

    Google Scholar 

  20. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992.

    Google Scholar 

  21. D. Sangiorgi. Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science, 155:39–83, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  22. D. Sangiorgi. π-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2):235–274, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  23. D. Sangiorgi. The name discipline of receptiveness. In 24th ICALP, LNCS 1256, Springer Verlag, 1997.

    Google Scholar 

  24. F. van Breugel. A Labelled Transition System for the πε-calculus. In Proc. of TAPSOFT '97, LNCS 1214. Springer Verlag, April 1997.

    Google Scholar 

  25. N. Yoshida. Minimality and Separation Results on Asynchronous Mobile Processes: representability theorem by concurrent combinators. Submitted, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia-Antipolis, France

    Massimo Merro & Davide Sangiorgi

Authors
  1. Massimo Merro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Davide Sangiorgi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merro, M., Sangiorgi, D. (1998). On asynchrony in name-passing calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055108

Download citation

  • DOI: https://doi.org/10.1007/BFb0055108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation