Abstract
Process algebra semantics can be categorised into truecon-currency semantics, where parallel composition is considered a primitive operator, and interleaving semantics, where concurrency is reduced to sequentiality plus non-determinism. The former have an appealing intuitive justification, but the latter are mathematically more tractable.
This paper addresses the study of true-concurrency semantics in the framework of process algebras for mobile systems, like π-calculus [MPW92, Mil91]. We focus on location bisimulation (≈l), in our opinion one of the most convincing true-concurrency equivalences, which aims to describe the spatial dependencies on processes. Our main contribution is to show that in π-calculus ≈l can be expressed, or implemented, within the ordinary interleaving observation equivalence [Mil89, MPW92] by means of a fairly simple and fully abstract encoding. Thus, we can take advantage of the easier theory of observation equivalence to reason about ≈l. We illustrate this with a few examples, including the proof of the congruence properties of ≈l. We show that in π-calculus ≈l is not a congruence, and that the full abstraction of the encoding extends to the induced congruence.
The results in the paper also shed more light on the expressive power of π-calculus.
Work supported by the ESPRIT BRA project “CONFER”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto. A static view of localities. Rapport de recherche 1483, INRIA-Sophia Antipolis, 1991. To appear in Formal Aspects of Computing.
S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Informatica, 29:737–760, 1992.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. TR 4/91, University of Sussex, 1991. To appear in Theoretical Computer Science. Extended Abstract in Proc. MFCS 91, LNCS 520, 1991.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. TR 13/91, University of Sussex, 1991. To appear in Formal Aspects of Computing. Extended Abstract in Proc. CONCUR 92, 1992.
I. Castellani. Observing distribution in processes. In Proc. MFCS 93. Springer Verlag, 1993.
F. Corradini and R. De Nicola. Locality and causality in distributed process algebras. Report SI/R/R-93/05, Dipartimento di Scienze dell'Informazione, Università degli studi di Roma ”La Sapienza”, 1993.
P. Degano and P. Darondeau. Causal trees. In 15th ICALP, volume 372 of Lecture Notes in Computer Science, pages 234–248. Springer Verlag, 1989.
P. Degano and C. Priami. Proved trees. In W. Kuich, editor, Proc. ICALP 92, volume 623 of Lecture Notes in Computer Science. Springer Verlag, 1992.
R. Gorrieri and C. Laneve. The limit of splitn-bisimulations for CCS agents. In Proc. MFCS 91, volume 520 of Lecture Notes in Computer Science, pages 170–180. Springer Verlag, 1991.
R.J. van Glabbeek and F.W. Vaandrager. Petri nets models for algebraic theories of concurrency. In Proc. PARLE Conference, volume 259 of Lecture Notes in Computer Science, pages 224–242. Springer Verlag, 1987.
A. Kiehn. Local and global causes. Technical Report Report 342/23/91, Technische Universität München, 1991.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991. Also in Logic and Algebra of Specification, ed. F.L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993.
R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.
M. Mukund and M. Nielsen. CCS, locations and asynchronous transition systems. In Proc. FST-TCS 92, volume 652 of Lecture Notes in Computer Science, pages 328–341. Springer Verlag, 1992.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.
M. Montanari and D. Yankelevich. A parametric approach to localities. In W. Kuich, editor, Proc. ICALP 92, volume 623 of Lecture Notes in Computer Science, pages 617–628. Springer Verlag, 1992.
J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Technical Report ECS-LFCS-93-262, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1993. Short version to appear in the Proc. REX Summer School 1993, LNCS, Springer Verlag.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992. Also published as ECS-LFCS-93-266.
D. Sangiorgi. A theory of bisimulation for the π-calculus. Technical Report ECS-LFCS-93-270, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1993. Extended Abstract in Proc. CONCUR '93, volume 715 of Lecture Notes in Computer Science, Springer Verlag.
D. Sangiorgi. Bisimulations up to context (provisory title). In preparation, 1994. LFCS, Edinburgh.
D. Sangiorgi. Full version of this paper. To Appear as Technical Report, Department of Computer Science, University of Edinburgh, 1994.
D. Sangiorgi and R. Milner. The problem of “Weak Bisimulation up to”. In W.R. Cleveland, editor, Proceedings of CONCUR '92, volume 630, pages 32–46. Springer Verlag, 1992.
D. Walker. Objects in the π-calculus. Information and Computation, 1993. To appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sangiorgi, D. (1994). Locality and true-concurrency in calculi for mobile processes. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_107
Download citation
DOI: https://doi.org/10.1007/3-540-57887-0_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57887-1
Online ISBN: 978-3-540-48383-0
eBook Packages: Springer Book Archive