A Coalgebraic View on Reachability
Category Theory
2020-01-15 v3
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.
Cite
@article{arxiv.1901.10717,
title = {A Coalgebraic View on Reachability},
author = {Thorsten Wißmann and Stefan Milius and Shin-ya Katsumata and Jérémy Dubut},
journal= {arXiv preprint arXiv:1901.10717},
year = {2020}
}