Abstract
In [BGZ03] we provided a discrimination result between recursive definitions and replication in a fragment of CCS by showing that termination (i.e., all computations terminate) is undecidable in the calculus with recursion, whereas it turns out to be decidable in the calculus with replication. Here we extend the results in [BGZ03] by considering iteration, a third mechanism for expressing infinite behaviours. We show that convergence (i.e., the existence of a terminating computation) is undecidable in the calculus with replication, whereas it is decidable in the calculus with iteration. We also show that recursion, replication and iteration constitute a strict expressiveness hierarchy w.r.t. weak bisimulation: namely, there exist weak bisimulation preserving encodings of iteration in replication (and of replication in recursion), whereas there exist no weak bisimulation preserving encoding in the other direction.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. Recursive Definitions in Channel Based Calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133–144. Springer, Heidelberg (2003)
Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256, 63–92 (2001)
Giambiagi, P., Schneider, G., Valencia, F.D.: On the Expressiveness of CCS-like Calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 226–240. Springer, Heidelberg (2004)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 236–366 (1952)
Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86(1), 43–68 (1990)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
Nielsen, M., Palamidessi, C., Valencia, F.D.: On the Expressive Power of Temporal Concurrent Constraint Programming Languages. In: Proc. of PPDP 2002, ACM Press, New York (2002)
Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal of Computing 16(6), 973–989 (1987)
Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM 10, 217–255 (1963)
Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 197–208. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Gabbrielli, M., Zavattaro, G. (2004). Comparing Recursion, Replication, and Iteration in Process Calculi. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive