21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus Seattle, Washington August 12-August 15 ISBN: 0-7695-2631-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.39
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.
Citation:
Catuscia Palamidessi, Vijay Saraswat, Frank D. Valencia, Bjorn Victor, "On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus," lics, pp.59-68, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb