Full abstraction for fair testing in CCS
Logic in Computer Science
2013-05-28 v1
Abstract
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent presheaf semantics and as a concurrent game semantics. It is here proved that a behavioural equivalence induced by this semantics on CCS processes is fully abstract for fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the 'rule of the game'. From any playground, two languages, equipped with labelled transition systems, are derived, as well as a strong, functional bisimulation between them.
Cite
@article{arxiv.1305.6184,
title = {Full abstraction for fair testing in CCS},
author = {Tom Hirschowitz},
journal= {arXiv preprint arXiv:1305.6184},
year = {2013}
}
Comments
15 pages, to appear in CALCO '13. To appear Lecture notes in computer science (2013)