Tree-functors, determinacy and bisimulations

DOI10.1017/S0960129509990272zbMath1206.68214OpenAlexW2104004923MaRDI QIDQ3564340

Rocco De Nicola, Daniele Gorla, Anna Labella

Publication date: 2 June 2010

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

Full work available at URL: https://doi.org/10.1017/s0960129509990272

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes ⋮ 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

This page was built for publication: Tree-functors, determinacy and bisimulations