Matching in the Pi-Calculus
release_jjxoguk55be7xebnzffiqvtc74
by
Kirstin Peters, Uwe
Nestmann
2014
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.
In text/plain
format
Archived Files and Locations
application/pdf 154.8 kB
file_xljvw4ce7jadzamxbllf2skkrm
|
arxiv.org (repository) web.archive.org (webarchive) |
1408.1454v1
access all versions, variants, and formats of this works (eg, pre-prints)