Full abstraction for fair testing in CCS (expanded version)

DOI10.2168/LMCS-10(4:2)2014MaRDI QIDQ2929593zbMATH OpenFDO

Authors Tom Hirschowitz

Publication date 13 November 2014

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.8056

zbMATH Keywords

programming languagescategorical semanticsconcurrencygame semanticsprocess algebrapresheaf semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• Full abstraction for fair testing in CCS
• Innocent strategies as presheaves and interactive equivalences for CCS
• scientific article; zbMATH DE number 3900141
• scientific article; zbMATH DE number 1231450
• A Game Semantics of Idealized CSP

Cited in

(4)

• scientific article; zbMATH DE number 7204431 (Why is no real title available?)
• Full abstraction for fair testing in CCS
• Innocent strategies as presheaves and interactive equivalences for CCS
• Fibred pseudo double categories for game semantics

This page was built for publication: Full abstraction for fair testing in CCS (expanded version)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929593)