文章基本信息

标题：Full abstraction for fair testing in CCS (expanded version)
本地全文：下载
作者：Tom Hirschowitz
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2014
卷号：10
期号：4
页码：1
DOI：10.2168/LMCS-10(4:2)2014
出版社：Technical University of Braunschweig
摘要：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.
其他关键词：Programming languages; categorical semantics; presheaf semantics; game semantics; concurrency; process algebra