Bisimilarity of Diagrams

DOI10.1007/978-3-030-43520-2_5OpenAlexW3013869676MaRDI QIDQ5098713

Jérémy Dubut

Publication date: 30 August 2022

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.10886

zbMATH Keywords

diagramsopen mapsexistential theoriespath logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Compositional equivalences based on open pNets

Cites Work

• The complexity of elementary algebra and geometry
• Coalgebra morphisms subsume open maps
• Directed homology theories and Eilenberg-Steenrod axioms
• Bisimulation from open maps
• Path category for free. Open morphisms from coalgebras with non-deterministic branching
• Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
• Relationships between nondeterministic and deterministic tape complexities
• A Coalgebraic Perspective on Minimization and Determinization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimilarity of Diagrams