A coalgebraic view on reachability

DOI10.14712/1213-7243.2019.026OpenAlexW3007238611MaRDI QIDQ5218979

Jérémy Dubut, Shin-ya Katsumata, Thorsten Wißmann, Stefan Milius

Publication date: 6 March 2020

Published in: Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

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

zbMATH Keywords

coalgebrareachabilityKleisli category

Mathematics Subject Classification ID

General theory of categories and functors (18A99) Categories of machines, automata (18B20) Theory of computing (68Q99)

Related Items

Minimality Notions via Factorization Systems and Examples, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
• Introduction to extensive and distributive categories
• Universal coalgebra: A theory of systems
• Coalgebra morphisms subsume open maps
• Bisimulation from open maps
• Coalgebra learning via duality
• Terminal coalgebras in well-founded set theory
• Well-Pointed Coalgebras
• Nominal Sets
• Nominal Coalgebraic Data Types with Applications to Lambda Calculus
• Coproducts of Monads on Set
• Nominal Automata with Name Binding
• The temporal logic of coalgebras via Galois algebras
• On Finitary Functors
• Finitary Corecursion for the Infinitary Lambda Calculus
• Generic Trace Semantics via Coinduction
• Algebra and Coalgebra in Computer Science