On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

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

(1) , (2) , (1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
main.pdf (152.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00201096 , version 1 (23-12-2007)

Identifiers

Cite

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⟩
163 View
154 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More