Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebraic view on systems to derive, in a uniform way, abstract procedures for checking behavioural equivalence in coalgebras, which perform (a combination of) minimization and determinization. First, we show that for coalgebras in categories equipped with factorization structures, there exists an abstract procedure for equivalence checking. Then, we consider coalgebras in categories without suitable factorization structures: under certain conditions, it is possible to apply the above procedure after transforming coalgebras with reflections. This transformation can be thought of as some kind of determinization. We will apply our theory to the following examples: conditional transition systems and (non-deterministic) automata. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Adámek, J., Bonchi, F., Hülsbusch, M., König, B., Milius, S., & Silva, A. (2012). A coalgebraic perspective on minimization and determinization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7213 LNCS, pp. 58–73). https://doi.org/10.1007/978-3-642-28729-9_4
Mendeley helps you to discover research relevant for your work.