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/12/1
Y1 - 2006/12/1
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.
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 -