ACM Transactions on Programming Languages and Systems (TOPLAS)
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
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
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
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
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
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)
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
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
Parametrised Constants and Replication for Spatial Mobility
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Correctly translating concurrency primitives
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
From the π-calculus to flat GHC
Proceedings of the 14th symposium on Principles and practice of declarative programming
Strong Normalization in the π-calculus with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
In this paper, we present a unified approach to evaluating 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 good means for language comparison. We argue that the combination of such criteria is a valid proposal by noting that: (i) the best known encodings appeared in the literature satisfy them; (ii) this notion is not trivial, because there exist encodings that do not satisfy all the criteria we have proposed; (iii) the best 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 way in which we prove known separation results is easier and more uniform than the way in which such results were originally proved.