Innocent strategies as presheaves and interactive equivalences for CCS

zbMATH Open1424.68103arXiv1108.0463MaRDI QIDQ4621160FDOQ4621160

Authors: Tom Hirschowitz, Damien Pous 

Publication date: 8 February 2019

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

Recommendations

• Full abstraction for fair testing in CCS (expanded version)
• Full abstraction for fair testing in CCS
• Presheaf models for CCS-like languages
• scientific article; zbMATH DE number 4199644
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay

zbMATH Keywords

concurrencygame semanticsprogramming language semanticsbehavioural equivalencespresheaf modelsfair testing

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• Monoidal-closed categories of tree automata
• Distributed Strategies Made Easy
• Full abstraction for fair testing in CCS (expanded version)
• Bisimulation maps in presheaf categories
• Full abstraction for fair testing in CCS

This page was built for publication: Innocent strategies as presheaves and interactive equivalences for CCS

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