A Coalgebraic Perspective on Minimization and Determinization. - Archive ouverte HAL Access content directly
Conference Papers Lecture Notes in Computer Science Year : 2012

A Coalgebraic Perspective on Minimization and Determinization.


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.
Not file

Dates and versions

hal-00798063 , version 1 (07-03-2013)


  • HAL Id : hal-00798063 , version 1


Jirí Adámek, Filippo Bonchi, Mathias Hulsbusch, Barbara König, Stefan Milius, et al.. A Coalgebraic Perspective on Minimization and Determinization.. Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, 2012, Estonia. pp.58-73. ⟨hal-00798063⟩
178 View
0 Download


Gmail Facebook Twitter LinkedIn More