International audienceIn 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 pi-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
International audienceThe article reviews the various ways sequential composition is defined in trad...
Le concept de réversibilité est ancien, mais il soulève de nos jours beaucoup d'intérêt. Il est en e...
International audienceExisting formalisms for the algebraic specification and representation of netw...
International audienceIn this paper we shall survey and discuss in detail the work on the relative e...
International audienceIn this paper we shall survey and discuss in detail the work on the relative e...
We investigate the expressive power of three alternative approaches for the definition of infinite b...
AbstractIn the π-calculus with replication, two processes are multiset congruent if they have the sa...
The pi-calculus [61] is one the most influential formalisms for modelling and analyzing the behaviou...
Existing formalisms for the algebraic specification and representation of networks of reversible age...
We use some recent techniques from process algebra to draw several conclusions about the well studie...
The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages d...
International audienceComputation can be considered by taking into account two dimensions: extension...
International audienceWe study the expressive power of restriction and its interplay with replicatio...
The paper presents a foundational analysis of the class of ambient calculi focussing on the spatial ...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
International audienceThe article reviews the various ways sequential composition is defined in trad...
Le concept de réversibilité est ancien, mais il soulève de nos jours beaucoup d'intérêt. Il est en e...
International audienceExisting formalisms for the algebraic specification and representation of netw...
International audienceIn this paper we shall survey and discuss in detail the work on the relative e...
International audienceIn this paper we shall survey and discuss in detail the work on the relative e...
We investigate the expressive power of three alternative approaches for the definition of infinite b...
AbstractIn the π-calculus with replication, two processes are multiset congruent if they have the sa...
The pi-calculus [61] is one the most influential formalisms for modelling and analyzing the behaviou...
Existing formalisms for the algebraic specification and representation of networks of reversible age...
We use some recent techniques from process algebra to draw several conclusions about the well studie...
The tcc paradigm is a formalism for timed concurrent constraint programming. Several tcc languages d...
International audienceComputation can be considered by taking into account two dimensions: extension...
International audienceWe study the expressive power of restriction and its interplay with replicatio...
The paper presents a foundational analysis of the class of ambient calculi focussing on the spatial ...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
International audienceThe article reviews the various ways sequential composition is defined in trad...
Le concept de réversibilité est ancien, mais il soulève de nos jours beaucoup d'intérêt. Il est en e...
International audienceExisting formalisms for the algebraic specification and representation of netw...