On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi-Calculus
2006 (English)In: Proc. 21st Symposium on Logic In Computer Science: LICS 2006, Piscataway, NJ: IEEE , 2006, 59-68 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Piscataway, NJ: IEEE , 2006. 59-68 p.
Computer Science Computer Engineering
IdentifiersURN: urn:nbn:se:uu:diva-80780DOI: 10.1109/LICS.2006.39ISBN: 0-7695-2631-4OAI: oai:DiVA.org:uu-80780DiVA: diva2:108694