Abstract
We introduce local environments for mobile processes, expressed in π-calculus. Each local name is equipped with its relative address, i.e., with the information needed to point back to the process that generated it. Relative addresses are built upon the labels of the proved transition system of π-calculus. A router is specified that guarantees sound exportation of names.
Work partially supported by ESPRIT Basic Research Action n.8130 — LOMAPS
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Boreale and D. Sangiorgi. A fully abstract semantics of causality in the π-calculus. In Proceedings of STAGS'95, LNCS. Springer Verlag, 1995.
Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, and Bent Thomsen. Understanding mobile agents via a non-interleaving semantics for Facile. Technical Report ECRC-96-4, European Computer-Industry Research Centre, 1996.
Ph. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP'89, LNCS 372, pages 234–248. Springer-Verlag, 1989.
P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629–640. Springer-Verlag, 1992.
P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS 944, pages 660–671. Springer-Verlag, 1995.
A. Giacalone, P. Mishra, and S. Prasad. Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming. In Proceedings ICALP'90, LNCS 443, pages 765–780. Springer-Verlag, 1990.
R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, 1991.
R. Milner, D. Berry, and D. Turner. A semantics for ML concurrency primitives. In Proceedings of POPL'92, 1992.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (I and II). Information and Computation, 100(1):1–77, 1992.
F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, pages 497–543, 1992.
J. Reppy. Higher order concurrency. PhD thesis, Cornell University, TR 92-1285, 1992.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992.
B. Thomsen, L. Leth, S. Prasad, T.-M. Kuo, A. Kramer, F. Knabe, and A. Giacalone. Facile Antigua Release Programming Guide. Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993.
D. Walker. Objects in the π-calculus. Information and Computation, 1994. To appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodei, C., Degano, P., Priami, C. (1996). Mobile processes with a distributed environment. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_153
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_153
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive