Communicating sequential processes
Communicating sequential processes
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Some congruence properties for &pgr;-calculus bisimilarities
Theoretical Computer Science
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Information and Computation
Communicating sequential processes
Communications of the ACM
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
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)
Matching Systems for Concurrent Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Election and rendezvous with incomparable labels
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
On the Asynchronous Nature of the Asynchronous Π-Calculus
Concurrency, Graphs and Models
Symmetric and Synchronous Communication in Peer-to-Peer Networks
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness of Multiple Heads in CHR
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
On the Expressive Power of Process Interruption and Compensation
Web Services and Formal Methods
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
On the expressive power of priorities in CHR
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
On the expressiveness of interaction
Theoretical Computer Science
A concurrent calculus with atomic transactions
ESOP'07 Proceedings of the 16th European conference on Programming
A core calculus for a comparative analysis of bio-inspired calculi
ESOP'07 Proceedings of the 16th European conference on Programming
π@: a π-based process calculus for the implementation of compartmentalised bio-inspired calculi
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
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 and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A general name binding mechanism
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
The computational power of the W And GHZ States
Quantum Information & Computation
On the Expressive Power of Multiple Heads in CHR
ACM Transactions on Computational Logic (TOCL)
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On a probabilistic chemical abstract machine and the expressiveness of linda languages
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
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
Election in the qualitative world
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Basic observables for a calculus for global computing
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
From the π-calculus to flat GHC
Proceedings of the 14th symposium on Principles and practice of declarative programming
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
The expressive power of CHR with priorities
Information and Computation
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Theories of Programming and Formal Methods
A Compositional Semantics for the Reversible p-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.01 |
The Asynchronous $\pi$-calculus, proposed in Honda and Tokoro (1991) and, independently, in Boudol (1992), is a subset of the $\pi$-calculus (Milner et al. 1992), which contains no explicit operators for choice and output prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output prefixing, as shown in Honda and Tokoro (1991) and Boudol (1992), and input-guarded choice, as shown in Nestmann and Pierce (2000). A natural question arises, then, as to whether or not it is as expressive as the full $\pi$-calculus. We show that this is not the case. More precisely, we show that there does not exist any uniform, fully distributed translation from the $\pi$-calculus into the asynchronous $\pi$-calculus, up to any ‘reasonable’ notion of equivalence. This result is based on the incapability of the asynchronous $\pi$-calculus to break certain symmetries that may be present in the initial communication graph. By similar arguments, we prove a separation result between the $\pi$-calculus and CCS, and between the $\pi$-calculus and the $\pi$-calculus with internal mobility, a subset of the $\pi$-calculus proposed by Sangiorgi where the output actions can only transmit private names.