A Coalgebraic View on Reachability

DOI10.14712/1213-7243.2019.026MaRDI QIDQ6313287arXivFDO

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

Publication date 30 January 2019

Published in arXiv

Full work available at URL https://doi.org/10.14712/1213-7243.2019.026

Mathematics Subject Classification ID

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

arXiv classification

math.CT

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.

This page was built for publication: A Coalgebraic View on Reachability

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