Full abstraction for fair testing in CCS (expanded version)

In previous work with Pous, we defined a semantics for CCS which may both beviewed as an innocent form of presheaf semantics and as a concurrent form ofgame semantics. We define in this setting an analogue of fair testingequivalence, which we prove fully abstract w.r.t. standard fair testingequivalence. The proof relies on a new algebraic notion called playground,which represents the `rule of the game'. From any playground, we derive twolanguages equipped with labelled transition systems, as well as a strong,functional bisimulation between them.Comment: 80 page