Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay

DOI10.1016/S0304-3975(01)00247-XzbMath1028.68085MaRDI QIDQ1398465

Thomas Troels Hildebrandt

Publication date: 29 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Full abstractionConcurrencyFairnessFinite delayOpen maps

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)

Related Items

Bisimulation maps in presheaf categories

Cites Work

• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• Sheaves in geometry and logic: a first introduction to topos theory
• Presheaf models for CCS-like languages
• Bisimulation from open maps
• The expressive power of indeterminate primitives in asynchronous computation
• “Sometimes” and “not never” revisited
• Equivalences for fair Kripke structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item