Skip to main content

Internal mobility and agent-passing calculi

  • Concurrency II
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

In process calculi, mobility indicates the possibility of dynamic reconfigurations of the process linkage. Name- passing calculi like the π-calculus achieve mobility via communication of names. The names exchanged can be internal or external. Accordingly, we can distinguish between internal and external mobility. In [San94b] it is shown that the subcalculus of the π-calculus which only uses internal mobility, called πI, has a simple algebraic theory but, at the same time, is expressive enough to encode, for instance, the λ-calculus.

In this paper, we compare name-passing calculi based on internal mobility with agent-passing calculi, i.e., calculi where mobility is achieved via exchange of agents. By imposing bounds on the order of the types of πI and of the Higher-Order π-calculus we define a hierarchy of name-passing calculi based on internal mobility and one of agent-passing calculi. We show that there is an exact correspondence, in terms of expressiveness, between the two hierarchies. This refines and complements previous results on the comparison between name-passing and agent-passing calculi by Thomsen, Sangiorgi and Amadio.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Amadio. On the reduction of CHOCS bisimulation to π-calculus bisimulation. Proc. CONCUR '93, LNCS 715. Springer Verlag, 1993.

    Google Scholar 

  2. M. Boreale and D. Sangiorgi. A fully abstract semantics for causality in the π-calculus. Proc. STACS '95, LNCS 900, Springer Verlag 1995.

    Google Scholar 

  3. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95–169, 1983.

    Google Scholar 

  4. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  5. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification, Springer Verlag, 1993.

    Google Scholar 

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

    Google Scholar 

  7. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In 8th LICS Conf.. IEEE Computer Society Press, 1993.

    Google Scholar 

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

    Google Scholar 

  9. D. Sangiorgi. πI: A symetric calculus based on internal mobility. To appear in Proc. ICALP '95, LNCS.

    Google Scholar 

  10. B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sangiorgi, D. (1995). Internal mobility and agent-passing calculi. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_114

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics