[Paper Review] Comparing the expressive power of the Synchronous and the Asynchronous pi-calculus

Catuscia Palamidessi|arXiv (Cornell University)|Sep 2, 1998

Logic, programming, and type systems5 citations

TL;DR

This paper proves that the asynchronous pi-calculus cannot uniformly and parallel-preservingly translate the full pi-calculus, even up to reasonable equivalences, due to its inability to break certain symmetries in the initial communication graph. The result establishes a strict separation in expressive power between the two calculi, with implications for process calculus design and behavioral equivalence in concurrent systems.

ABSTRACT

The Asynchronous pi-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the pi-calculus 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 by Boudol, and input-guarded choice, as shown recently by Nestmann and Pierce. A natural question arises, then, whether or not it is possible to embed in it the full pi-calculus. We show that this is not possible, i.e. there does not exist any uniform, parallel-preserving, translation from the pi-calculus into the asynchronous pi-calculus, up to any ``reasonable'' notion of equivalence. This result is based on the incapablity of the asynchronous pi-calculus of breaking certain symmetries possibly present in the initial communication graph. By similar arguments, we prove a separation result between the pi-calculus and CCS.

Motivation & Objective

• To determine whether the asynchronous pi-calculus can express all behaviors of the full pi-calculus.
• To investigate the limitations of the asynchronous pi-calculus in handling symmetric communication patterns.
• To formally separate the expressive power of the asynchronous pi-calculus from that of the full pi-calculus.
• To analyze the role of symmetry breaking in process calculi and its impact on behavioral equivalence.
• To establish that no uniform, parallel-preserving translation exists from the pi-calculus to the asynchronous pi-calculus under reasonable equivalence notions.

Proposed method

• Constructing a formal model of the asynchronous pi-calculus as a subset of the pi-calculus without explicit choice and output-prefixing operators.
• Using symmetry arguments in the initial communication graph to identify structural limitations in the asynchronous calculus.
• Demonstrating that the asynchronous calculus cannot break symmetries present in certain process configurations.
• Applying the concept of uniform, parallel-preserving translation to compare behavioral equivalence across the two calculi.
• Leveraging known results on simulation of output-prefixing and input-guarded choice in the asynchronous calculus to isolate the core expressive limitation.
• Proving that the inability to break symmetries prevents any such translation from preserving behavioral equivalence.

Experimental results

Research questions

• RQ1 Can the asynchronous pi-calculus uniformly and parallel-preservingly translate the full pi-calculus?
• RQ2 What structural limitations prevent the asynchronous pi-calculus from simulating all pi-calculus behaviors?
• RQ3 Is there a behavioral equivalence under which the full pi-calculus is strictly more expressive than the asynchronous pi-calculus?
• RQ4 How do symmetries in the initial communication graph affect the expressive power of process calculi?
• RQ5 Can the asynchronous pi-calculus simulate input-guarded choice and output-prefixing without introducing asymmetries?

Key findings

• There does not exist any uniform, parallel-preserving translation from the pi-calculus into the asynchronous pi-calculus.
• The asynchronous pi-calculus cannot break certain symmetries present in the initial communication graph, which limits its expressive power.
• This symmetry-breaking incapability establishes a strict separation between the expressive power of the pi-calculus and the asynchronous pi-calculus.
• The result holds under any 'reasonable' notion of equivalence, indicating a fundamental limitation of the asynchronous calculus.
• The separation result also applies to comparisons between the pi-calculus and CCS, showing similar expressive power limitations.
• The findings confirm that the asynchronous pi-calculus, despite simulating key operators like output-prefixing and input-guarded choice, remains strictly less expressive than the full pi-calculus.