Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
An efficiency preorder for processes
Acta Informatica
Embedding as a tool for language comparison
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation for higher-order process calculi
Information and Computation
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Processes, functions, and datatypes
Theory and Practice of Object Systems - Special issue on selected papers from ESEC/FSE'97 (Joint Meeting of the European Software Engineering Conference and ACM Foundations of Software Engineering)
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
Proof, language, and interaction
Information and Computation
Resource access control in systems of mobile agents
Information and Computation
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Types for the ambient calculus
Information and Computation - IFIP TCS2000
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Mobility Types for Mobile Ambients
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On Synchronous and Asynchronous Mobile Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Spi Calculus Translated to "--Calculus Preserving May-Tests
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Matching Systems for Concurrent Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing communication primitives via their relative expressive power
Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Types and full abstraction for polyadic π-calculus
Information and Computation
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A fully abstract encoding of the π-calculus with data terms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Expressing global priorities by best-matching
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Information and Computation
| Hi-index | 0.00 |
We present a unified approach to evaluate the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already been somehow presented in the literature) that an encoding should satisfy to be considered a valid means for language comparison. We argue that the combination of such criteria is a valid proposal by noting that: (i) several well-known encodings appeared in the literature satisfy them; (ii) this notion is not trivial, because some known encodings do not satisfy all the criteria we have proposed; (iii) several well-known separation results can be formulated in terms of our criteria; and (iv) some widely believed (but never formally proved) separation results can be proved by using the criteria we propose. Moreover, the criteria defined induce general proof-techniques for separation results that can be easily instantiated to cover known case-studies.