arXiv · 1901.10717
A Coalgebraic View on Reachability
Abstract
Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired by and resembles the standard breadth-first search procedure to compute the reachable part of a graph. We also study coalgebras in Kleisli categories: for a functor extending a functor on the base category, we show that the reachable part of a given pointed coalgebra can be computed in that base category.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Thorsten Wißmann, Stefan Milius, Shin-ya Katsumata, Jérémy Dubut. 2020-01-14. A Coalgebraic View on Reachability. https://arxiv.org/abs/1901.10717
Cite the original work for its findings. Save a collection to share your selection of sources.