2013/05/27 by Tom Hirschowitz, Hirschowitz, Tom
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
paper · pdf · doi:10.48550/arxiv.1305.6184
15 pages, to appear in CALCO '13. To appear Lecture notes in computer science (2013)
arxiv created 2013/05/27 · openalex publication_date 2013/05/27 · arxiv updated 2013/05/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.