uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi-Calculus
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)ORCID iD: 0000-0003-0174-9032
2006 (English)In: Proc. 21st Symposium on Logic In Computer Science: LICS 2006, Piscataway, NJ: IEEE , 2006, 59-68 p.Conference paper (Refereed)
Abstract [en]

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.
National Category
Computer Science Computer Engineering
URN: urn:nbn:se:uu:diva-80780DOI: 10.1109/LICS.2006.39ISBN: 0-7695-2631-4OAI: oai:DiVA.org:uu-80780DiVA: diva2:108694
Available from: 2006-10-06 Created: 2006-10-06 Last updated: 2016-02-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Victor, Björn
By organisation
Computing Science
Computer ScienceComputer Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 221 hits
ReferencesLink to record
Permanent link

Direct link