Abstract
We investigate the expressive power of two alternative approaches used to express infinite behaviours in process calculi, namely, replication and recursive definitions. These two approaches are equivalent in the full π-calculus, while there is a common agreement that this is not the case when name mobility is not allowed (as in the case of CCS), even if no formal discriminating results have been proved so far.
We consider a hierarchy of calculi, previously proposed by Sangiorgi, that spans from a fragment of CCS (named “the core of CCS”) to the π-calculus with internal mobility. We prove the following discrimination result between replication and recursive definitions: the termination of processes is an undecidable property in the core of CCS, provided that recursive process definitions are allowed, while termination turns out to be decidable when only replication is permitted. On the other hand, this discrimination result does not hold any longer when we move to the next calculus in the hierarchy, which supports a very limited form of name mobility.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Boreale. On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science, 195(2): 205–226, 1998.
N. Busi, M. Gabbrielli, and G. Zavattaro. Replication vs. Recursive Definitions in Channel Based Calculi (extended version). Available at http://cs.unibo.it/~zavattar/papers.html.
L. Cardelli and A.D. Gordon. Mobile Ambients. Theoretical Computer Science, 240(1):177–213, 2000.
A. Finkel and Ph. Schnoebelen. Well-Structured Transition Systems Everywhere ! Theoretical Computer Science, 256:63–92, 2001.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner. Foreword of The pi-calculus: a Theory of Mobile Processes, by D. Sangiorgi and D. Walker. Cambridge University Press, 2001.
R. Milner, J. Parrow, D. Walker. A calculus of mobile processes. Journal of Information and Computation, 100:1–77. Academic Press, 1992.
M. Nielsen, C. Palamidessi, and F. D. Valencia. On the Expressive Power of Temporal Concurrent Constraint Programming Languages. In Proc. of 4th International Conference on Principles and Practice of Declarative Programming (PPDP 2002). ACM Press, 2002.
D. Sangiorgi. π-calculus, internal mobility, and agent-passing calculi. Theoretical Computer Science, 167(2):235–274, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Gabbrielli, M., Zavattaro, G. (2003). Replication vs. Recursive Definitions in Channel Based Calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive