Hirschowitz, Tom - Full abstraction for fair testing in CCS (expanded version)

lmcs:1090 - Logical Methods in Computer Science, October 31, 2014, Volume 10, Issue 4
Full abstraction for fair testing in CCS (expanded version)

Authors: Hirschowitz, Tom

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 : oai:arXiv.org:1409.8056
DOI : 10.2168/LMCS-10(4:2)2014
Volume: Volume 10, Issue 4
Published on: October 31, 2014
Submitted on: February 20, 2013
Keywords: Computer Science - Logic in Computer Science


Consultation statistics

This page has been seen 110 times.
This article's PDF has been downloaded 70 times.