Relational Presheaves as Labelled Transition Systems

DOI10.1007/978-3-642-32784-1_3zbMath1328.68139OpenAlexW82378783MaRDI QIDQ2914675

Paweł Sobociński

Publication date: 20 September 2012

Published in: Coalgebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32784-1_3

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20)

Related Items (2)

Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ Relational presheaves, change of base and weak simulation

This page was built for publication: Relational Presheaves as Labelled Transition Systems