On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus

Authors:
Catuscia Palamidessi;Vijay Saraswat;Frank D. Valencia;Bjorn Victor
Affiliations:
INRIA, France;IBM TJ Watson Research Lab, USA;CNRS, France;Uppsala University, Sweden
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 13

Free-algebra models for the π -calculus

Theoretical Computer Science
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Universal concurrent constraint programing: symbolic semantics and applications to security

Proceedings of the 2008 ACM symposium on Applied computing
Expressiveness of Process Algebras

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Unified Approach to Encodability and Separation Results for Process Calculi

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On the expressiveness of interaction

Theoretical Computer Science
Closures and modules within linear logic concurrent constraint programming

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Towards a unified approach to encodability and separation results for process calculi

Information and Computation
Deriving labels and bisimilarity for concurrent constraint programming

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
From the π-calculus to flat GHC

Proceedings of the 14th symposium on Principles and practice of declarative programming
Efficient computation of program equivalence for confluent concurrent constraint programming

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A general proof system for modalities in concurrent constraint programming

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.