Full abstraction for fair testing in CCS

Tom Hirschowitz (1)

1 LAMA - Laboratoire de Mathématiques

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.

Mots clés: process algebra; Programming languages; categorical semantics; presheaf semantics; game semantics; concurrency

Domaines: Logique en informatique [cs.LO]

Tom Hirschowitz. Full abstraction for fair testing in CCS. 5th Conference on Algebra and Coalgebra in Computer Science, 2013, Varsovie, France. pp.175-190, ⟨10.1007/978-3-642-40206-7_14⟩. ⟨hal-00826274⟩