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.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio. On the reduction of CHOCS bisimulation to π-calculus bisimulation. Proc. CONCUR '93, LNCS 715. Springer Verlag, 1993.
M. Boreale and D. Sangiorgi. A fully abstract semantics for causality in the π-calculus. Proc. STACS '95, LNCS 900, Springer Verlag 1995.
B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95–169, 1983.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification, Springer Verlag, 1993.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.
B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In 8th LICS Conf.. IEEE Computer Society Press, 1993.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Edinburgh, 1992.
D. Sangiorgi. πI: A symetric calculus based on internal mobility. To appear in Proc. ICALP '95, LNCS.
B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990.
Author information
Authors and Affiliations
Editor information
Rights 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