Presheaf models for CCS-like languages

DOI10.1016/S0304-3975(01)00209-2zbMath1028.68084OpenAlexW2084527595MaRDI QIDQ1399958

Glynn Winskel, Gian Luca Cattani

Publication date: 30 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00209-2

zbMATH Keywords

bisimulationsemanticsConcurrencyopen maps

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (4)

Models for name-passing processes: Interleaving and causal ⋮ Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay ⋮ Modal event-clock specifications for timed component-based design ⋮ Infinite trace equivalence

Cites Work

• Petri nets and bisimulation
• Modeling concurrency with partial orders
• Sheaves in geometry and logic: a first introduction to topos theory
• Categorical logic and type theory
• A completeness theorem for open maps
• Open maps, behavioural equivalences, and congruences
• Bisimulation from open maps
• Séminaire de géométrie algébrique du Bois Marie 1960/61 (SGA 1), dirigé par Alexander Grothendieck. Augmenté de deux exposés de M. Raynaud. Revêtements étales et groupe fondamental. Exposés I à XIII. (Seminar on algebraic geometry at Bois Marie 1960/61 (SGA 1), directed by Alexander Grothendieck. Enlarged by two reports of M. Raynaud. Ètale coverings and fundamental group)
• Axiomatic Domain Theory in Categories of Partial Maps
• Profunctors, open maps and bisimulation
• A presheaf semantics of value-passing processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Presheaf models for CCS-like languages