Work

Full abstraction for fair testing in CCS (expanded version)

Year: 2014

Type: article

Abstract: 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.

Source: Logical Methods in Computer Science

DOI: 10.2168/lmcs-10(4:2)2014

Author: Tom Hirschowitz

Institutions: Centre National de la Recherche Scientifique, Université Savoie Mont Blanc

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Awards: Realizability for classical logic, concurrency, references and rewriting, Formal Verification of Distributed Components, G7240651115