Skip to main content
SpringerLink
Log in

Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

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

Included in the following conference series:

  • 601 Accesses

Abstract

The π-calculus [6] has introduced in concurrency the concept of link mobility, namely the possibility of communicating values which can afterwards be used as communication means (i.e. channels). Since the original work on the π-calculus, many variants and related paradigms have been introduced, including the asynchronous π-calculus [1], [4], [5], the π-calculus with input-guarded choice [8], the π-calculus with internal communication [11], the Fusion Calculus [10], and the Join Calculus [2], [3]]. In general, these variants introduce restrictions that allow for a simpler formal treatment, and/or a more direct modeling of some of the features of distributed systems (like asynchronous communication).

Some recent results [7], [9] suggest that the expressive power of these variants can be very different when distribution constraints are taken into consideration. In this talk, I will focus on the relative expressiveness of some of these variants, and discuss possible approaches to their distributed implementation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, SophiaAntipolis, 1992.

    Google Scholar 

  2. C. Fournet and G. Gonthier. The Reflexive Chemical Abstract Machine and the Join-Calculus. In Proc. of the 23rd Annual Symposium on Principles of Programming Languages (POPL), pages 372–385, 1996.

    Google Scholar 

  3. C. Fournet, G. Gonthier, J.-J. Lévy, Luc Maranget, and D. Rémy. A Calculus of Mobile Agents. In U. Montanari, editor, Proc. of the 7th International Conference on Concurrency Theory (CONCUR), volume 1119 of Lecture Notes in Computer Science, pages 406–421, 1996.

    Google Scholar 

  4. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In P. America, editor, Proc. of ECOOP 91, volume 512 of Lecture Notes in Computer Science, pages 133–147. Springer-Verlag, 1991.

    Google Scholar 

  5. K. Honda and M. Tokoro. On asynchronous communication semantics. In M. Tokoro, O. Nierstrasz, and P. Wegner, editors, Proc. of Object-Based Concurrent Computing, volume 612 of Lecture Notes in Computer Science, pages 21–51. Springer-Verlag, 1992.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. U. Nestmann. What Is a ‘Good’ Encoding of Guarded Choice? In C. Palamidessi and J. Parrow, editors, Proc. of EXPRESS’97, volume 7 of Electronic Notes in Theoretical Computer Science, 1997. Extended version accepted for publication on Information and Computation.

    Google Scholar 

  8. U. Nestmann and B. C. Pierce. Decoding choice encodings. In U. Montanari, editor, Proc. of the 7th International Conference on Concurrency Theory (CONCUR), volume 1119 of Lecture Notes in Computer Science, pages 179–194. Springer-Verlag, 1996.

    Google Scholar 

  9. C. Palamidessi. Comparing the expressive power of the Synchronous and the Asynchronous π-calculus. In Proc. of the 24th ACM Symposium on Principles of Programming Languages (POPL), pages 256–265, ACM, 1997.

    Google Scholar 

  10. J. Parrow and B. Victor. The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. In Proc. of the Thirteenth Annual Symposium on Logic in Computer Science (LICS), pages 176–185, IEEE Computer Society Press, 1998.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Pennsylvania State University, Pennsylvania

    Catuscia Palamidessi

Authors
  1. Catuscia Palamidessi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palamidessi, C. (1999). Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation