Profunctors, open maps and bisimulation

DOI10.1017/S0960129505004718zbMath1169.68537MaRDI QIDQ5462666

Gian Luca Cattani, Glynn Winskel

Publication date: 3 August 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (19)

Strategies as concurrent processes ⋮ Bisimulation maps in presheaf categories ⋮ Higher dimensional categories: induction on extensivity ⋮ Prime algebraicity ⋮ Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures ⋮ Presheaf models for CCS-like languages ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Deterministic concurrent strategies ⋮ On operads, bimodules and analytic functors ⋮ Modal event-clock specifications for timed component-based design ⋮ Domain theory for concurrency ⋮ Some reasons for generalising domain theory ⋮ Analytic functors between presheaf categories over groupoids ⋮ Elements of a theory of algebraic theories ⋮ On the formal theory of pseudomonads and pseudodistributive laws ⋮ Categorical semantics for arrows ⋮ Distributed Strategies Made Easy ⋮ Event Structures with Symmetry ⋮ Event Structure Spans for Nondeterministic Dataflow

This page was built for publication: Profunctors, open maps and bisimulation