Comparing the expressiveness of the π-calculus and CCS

by   Rob van Glabbeek, et al.

This paper shows that the π-calculus with implicit matching is no more expressive than CCSγ, a variant of CCS in which the result of a synchronisation of two actions is itself an action subject to relabelling or restriction, rather than the silent action τ. This is done by exhibiting a compositional translation from the π-calculus with implicit matching to CCSγ that is valid up to strong barbed bisimilarity. The full π-calculus can be similarly expressed in CCSγ enriched with the triggering operation of Meije. I also show that these results cannot be recreated with CCS in the role of CCSγ, not even up to reduction equivalence, and not even for the asynchronous π-calculus without restriction or replication. Finally I observe that CCS cannot be encoded in the π-calculus.



page 1

page 2

page 3

page 4


On Up-to Context Techniques in the π-calculus

We present a variant of the theory of compatible functions on relations,...

A strong call-by-need calculus

We present a call-by-need λ-calculus that enables strong reduction (that...

Eager Functions as Processes (long version)

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...

On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus

Process calculi may be compared in their expressive power by means of en...

Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities

The Lambek calculus can be considered as a version of non-commutative in...

On the Recognizing Power of the Lambek Calculus with Brackets

Every language recognized by the Lambek calculus with brackets is contex...

An impure solution to the problem of matching fans

We present an algorithm to solve the problem of matching fans in interac...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.