On the expressiveness of linearity vs persistence in the asychronous pi-calculus

Catuscia Palamidessi; Vijay Saraswat; Frank D. Valencia; Björn Victor

doi:10.1109/LICS.2006.39

On the expressiveness of linearity vs persistence in the asychronous pi-calculus

Catuscia Palamidessi
, Vijay Saraswat
, Frank D. Valencia
, Björn Victor

LIX École Polytechnique de Paris
IBM TJ Watson Research Lab.
Uppsala University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006
Pages	59-68
Number of pages	10
DOIs	https://doi.org/10.1109/LICS.2006.39
State	Published - 2006
Externally published	Yes
Event	21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006 - Seattle, WA, United States Duration: 12 Aug 2006 → 15 Aug 2006

Publication series

Name	Proceedings - Symposium on Logic in Computer Science
ISSN (Print)	1043-6871

Conference

Conference	21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006
Country/Territory	United States
City	Seattle, WA
Period	12/08/06 → 15/08/06

Access to Document

10.1109/LICS.2006.39

Cite this

@inproceedings{d01096216f5b4b60b338dc40fc76671a,

title = "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 π-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.",

author = "Catuscia Palamidessi and Vijay Saraswat and Valencia, \{Frank D.\} and Bj{\"o}rn Victor",

year = "2006",

doi = "10.1109/LICS.2006.39",

language = "English",

isbn = "0769526314",

series = "Proceedings - Symposium on Logic in Computer Science",

pages = "59--68",

booktitle = "Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006",

note = "21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006 ; Conference date: 12-08-2006 Through 15-08-2006",

}

Palamidessi, C, Saraswat, V, Valencia, FD & Victor, B 2006, On the expressiveness of linearity vs persistence in the asychronous pi-calculus. in Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006., 1691217, Proceedings - Symposium on Logic in Computer Science, pp. 59-68, 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006, Seattle, WA, United States, 12/08/06. https://doi.org/10.1109/LICS.2006.39

On the expressiveness of linearity vs persistence in the asychronous pi-calculus. / Palamidessi, Catuscia; Saraswat, Vijay; Valencia, Frank D. et al.
Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006. 2006. p. 59-68 1691217 (Proceedings - Symposium on Logic in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the expressiveness of linearity vs persistence in the asychronous pi-calculus

AU - Palamidessi, Catuscia

AU - Saraswat, Vijay

AU - Valencia, Frank D.

AU - Victor, Björn

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/34547257087

U2 - 10.1109/LICS.2006.39

DO - 10.1109/LICS.2006.39

M3 - Conference contribution

AN - SCOPUS:34547257087

SN - 0769526314

SN - 9780769526317

T3 - Proceedings - Symposium on Logic in Computer Science

SP - 59

EP - 68

BT - Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006

T2 - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006

Y2 - 12 August 2006 through 15 August 2006

ER -

On the expressiveness of linearity vs persistence in the asychronous pi-calculus

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this