On recursion, replication and scope mechanisms in process calculi

Authors:
Jesús Aranda;Cinzia Di Giusto;Catuscia Palamidessi;Frank D. Valencia
Affiliations:
Universidad del Valle Cali, Colombia and LIX École Polytechnique Paris, France;Dip. Scienze dell'Informazione, Università di Bologna, Bologna, Italy;INRIA, LIX, École Polytechnique, Paris, France;CNRS, LIX, École Polytechnique, Paris, France
Venue:
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Year:
2006

Citing 14
Cited 3

Linear logic

Theoretical Computer Science
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
A calculus of mobile processes, II

Information and Computation
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency

Communication and Concurrency
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
On the expressive power of temporal concurrent constraint programming languages

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the expressive power of movement and restriction in pure mobile ambients

Theoretical Computer Science - Special issue: Foundations of wide area network computing
Replication vs. recursive definitions in channel based calculi

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Recursion versus replication in simple cryptographic protocols

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Parametrised Constants and Replication for Spatial Mobility

COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Making random choices invisible to the scheduler

Information and Computation
On the expressiveness of the π-calculus and the mobile ambients

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology

Quantified Score

Hi-index	0.00

Visualization

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.