Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00201096
Contributor : Catuscia Palamidessi <>
Submitted on : Sunday, December 23, 2007 - 4:19:58 PM
Last modification on : Thursday, March 5, 2020 - 6:18:31 PM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:26:56 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Catuscia Palamidessi, Vijay Saraswat, Frank 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⟩

Share

Metrics

Record views

448

Files downloads

347