Logic in Computer Science, Symposium on (2006)
Aug. 12, 2006 to Aug. 15, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.39
Catuscia Palamidessi , INRIA, France
Vijay Saraswat , IBM TJ Watson Research Lab, USA
Frank D. Valencia , CNRS, France
Bjorn Victor , Uppsala University, Sweden
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.
C. Palamidessi, F. D. Valencia, V. Saraswat and B. Victor, "On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus," 21st Annual IEEE Symposium on Logic in Computer Science(LICS), Seattle, WA, 2006, pp. 59-68.