Tree-functors, determinacy and bisimulations
From MaRDI portal
Publication:3564340
DOI10.1017/S0960129509990272zbMath1206.68214MaRDI QIDQ3564340
Anna Labella, Rocco De Nicola, Daniele Gorla
Publication date: 2 June 2010
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
A Finite Axiomatization of Nondeterministic Regular Expressions, Conduché property and tree-based categories
Cites Work
- Unnamed Item
- Conduché property and tree-based categories
- Towards a unified view of bisimulation: A comparative study
- Universal coalgebra: A theory of systems
- Coalgebra morphisms subsume open maps
- Unique factorisation lifting functors and categories of linearly-controlled processes
- Machines in a Category: An Expository Introduction
- Observational trees as models for concurrency