Matching in the Pi-Calculus

Matching in the Pi-Calculus

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 reflect...

Full description

Bibliographic Details
Main Authors: Kirstin Peters, Tsvetelina Yonova-Karbe, Uwe Nestmann
Format: Article
Language:English
Published: Open Publishing Association 2014-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1408.1454v1
id doaj-1e4d6821543c44d9a5f54f061de9b8ba
record_format Article
spelling doaj-1e4d6821543c44d9a5f54f061de9b8ba2020-11-24T22:52:48ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802014-08-01160Proc. EXPRESS/SOS 2014162910.4204/EPTCS.160.3:15Matching in the Pi-CalculusKirstin Peters0Tsvetelina Yonova-Karbe1Uwe Nestmann2 TU Berlin TU Berlin TU Berlin 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.http://arxiv.org/pdf/1408.1454v1
collection DOAJ
language English
format Article
sources DOAJ
author Kirstin Peters
Tsvetelina Yonova-Karbe
Uwe Nestmann
spellingShingle Kirstin Peters
Tsvetelina Yonova-Karbe
Uwe Nestmann
Matching in the Pi-Calculus
Electronic Proceedings in Theoretical Computer Science
author_facet Kirstin Peters
Tsvetelina Yonova-Karbe
Uwe Nestmann
author_sort Kirstin Peters
title Matching in the Pi-Calculus
title_short Matching in the Pi-Calculus
title_full Matching in the Pi-Calculus
title_fullStr Matching in the Pi-Calculus
title_full_unstemmed Matching in the Pi-Calculus
title_sort matching in the pi-calculus
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2014-08-01
description 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.
url http://arxiv.org/pdf/1408.1454v1
work_keys_str_mv AT kirstinpeters matchinginthepicalculus
AT tsvetelinayonovakarbe matchinginthepicalculus
AT uwenestmann matchinginthepicalculus
_version_ 1725664510877892608

Similar Items