Matching in the Pi-Calculus
Kirstin Peters (TU Berlin), Tsvetelina Yonova-Karbe (TU Berlin), Uwe, Nestmann (TU Berlin)
TL;DR
This paper investigates whether the match prefix in the pi-calculus can be expressed using other operators, providing a stronger non-expressibility result under relaxed encoding criteria.
Contribution
It presents a significantly stronger separation result showing the match prefix cannot be expressed using other operators in the pi-calculus under Gorla's relaxed criteria.
Findings
Match prefix is not expressible via other operators in pi-calculus.
Stronger non-expressibility result under relaxed encoding criteria.
Enhances understanding of the expressive power of pi-calculus operators.
Abstract
We study whether, in the pi-calculus, the match prefix-a conditional operator testing two names for (syntactic) equality-is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encodings that allows much more freedom (e.g. instead of direct translations of observables it allows comparison of calculi with respect to reachability of successful states). In this paper, we offer a considerably stronger separation result on the non-expressibility of matching using only Gorla's relaxed requirements.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.