Abstract
In this paper we shall survey and discuss in detail the work on the relative expressiveness of recursion and replication in various process calculi. Namely, CCS, the π-calculus, the Ambient calculus, Concurrent Constraint Programming and calculi for Cryptographic Protocols. We shall give evidence that the ability of expressing recursive behaviour via replication often depends on the scoping mechanisms of the given calculus which compensate for the restriction of replication. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Aranda, J., Giusto, C. D., Palamidessi, C., & Valencia, F. D. (2007). On recursion, replication and scope mechanisms in process calculi. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4709 LNCS, pp. 185–206). Springer Verlag. https://doi.org/10.1007/978-3-540-74792-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
