Full abstraction for fair testing in CCS (expanded version) - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2014

Full abstraction for fair testing in CCS (expanded version)

Tom Hirschowitz

Résumé

In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prove fully abstract w.r.t. standard fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the 'rule of the game'. From any playground, we derive two languages equipped with labelled transition systems, as well as a strong, functional bisimulation between them.
Fichier principal
Vignette du fichier
dcats-long.pdf (850.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00869469 , version 1 (03-10-2013)
hal-00869469 , version 2 (28-05-2014)
hal-00869469 , version 3 (29-09-2014)

Identifiants

Citer

Tom Hirschowitz. Full abstraction for fair testing in CCS (expanded version). Logical Methods in Computer Science, 2014, 10 (4), pp.2. ⟨10.2168/LMCS-10(4:2)2014⟩. ⟨hal-00869469v3⟩
195 Consultations
189 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More