Tree-functors, determinacy and bisimulations

DOI10.1017/S0960129509990272zbMATH Open1206.68214OpenAlexW2104004923MaRDI QIDQ3564340FDOQ3564340

Authors: 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

Recommendations

• Conduché property and tree-based categories
• scientific article; zbMATH DE number 1136647
• scientific article; zbMATH DE number 938519
• scientific article; zbMATH DE number 1231637
• Weak bisimulations for coalgebras over ordered functors

Mathematics Subject Classification ID

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

Cites Work

• Universal coalgebra: A theory of systems
• Title not available (Why is that?)
• Towards a unified view of bisimulation: A comparative study
• Machines in a Category: An Expository Introduction
• Conduché property and tree-based categories
• Unique factorisation lifting functors and categories of linearly-controlled processes
• Observational trees as models for concurrency
• Coalgebra morphisms subsume open maps

Cited In (8)

• Sequent Calculus in the Topos of Trees
• Types for Proofs and Programs
• Concise graphs and functional bisimulations
• Title not available (Why is that?)
• A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes
• Title not available (Why is that?)
• A Finite Axiomatization of Nondeterministic Regular Expressions
• Conduché property and tree-based categories

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564340)