On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus

We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the π-calculus. Each one singles out a natural source of linearity/persistence also present in other frameworks such as Concurrent Constraint Programming (CCP), Linear CCP, and several calculi for security. The study is presented by providing (or proving the non-existence of) encodings among the fragments, a processes-as-formulae interpretation and a reduction from Minsky machines. The fragments are: (1) The (polyadic) asynchronous πcalculus π, (2) persistent-input π defined as π with all inputs replicated, (3) persistent-output π defined as π with all outputs replicated, and (4) persistent π defined as π with all inputs and outputs replicated. We provide compositional fully-abstract encodings, homomorphic w.r.t the parallel operator, from (1) into (2) ...

• Type: Conference
• Year: 2006
• Where: LICS
• Authors: Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, Björn Victor
• Keywords: Compositional Fully-abstract Encodings, Computer Science, Concurrent Constraint Programming, LICS 2006, Zero-adic Versions