Fully-abstract concurrent games for pi
Logic in Computer Science
2013-10-17 v1
Abstract
We define a semantics for Milner's pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covered variants of bisimilarity and the may and must testing equivalences. Second, it is based on reduction semantics, whereas previous semantics were based on labelled transition systems. Finally, it has a strong game semantical flavor in the sense of Hyland-Ong and Nickau. Indeed, our model may both be viewed as an innocent presheaf semantics and as a concurrent game semantics.
Keywords
Cite
@article{arxiv.1310.4306,
title = {Fully-abstract concurrent games for pi},
author = {Clovis Eberhart and Tom Hirschowitz and Thomas Seiller},
journal= {arXiv preprint arXiv:1310.4306},
year = {2013}
}
Comments
20 pages, submitted