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

Catuscia Palamidessi (1) , Vijay Saraswat (2) , Frank D. Valencia (1) , Bjorn Victor (3)

1 COMETE - Concurrency, Mobility and Transactions
2 IBM Watson Research Center
3 DIT-UPPSALA - Department of Information Technology

We present an expressiveness study of linearity and persistence of processes. We choose the pi-calculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the pi-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.

Domaines: Logique en informatique [cs.LO]

Catuscia Palamidessi, Vijay Saraswat, Frank D. Valencia, Bjorn Victor. On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. Twenty First Annual IEEE Symposium on Logic in Computer Science (LICS), Aug 2006, Seattle, United States. pp.59-68, ⟨10.1109/LICS.2006.39⟩. ⟨inria-00201096⟩