Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata - Theoretical Computer Science Access content directly
Conference Papers Year : 2014

Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata

Abstract

Coalgebra offers a general framework for modelling different types of state-based systems. Our aim is to present generic algorithms to decide behavioural equivalence for coalgebras which generalize partition refinement. The underlying idea of the algorithms is to work on the final chain and to factor out redundant information. If the algorithm terminates, the result of the construction is a representative of the given coalgebra that is not necessarily unique and that allows to precisely answer questions about behavioural equivalence. We apply the algorithm to weighted automata over semirings in order to obtain a procedure for checking language equivalence for a large number of semirings.
Fichier principal
Vignette du fichier
978-3-662-44602-7_24_Chapter.pdf (296.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01402080 , version 1 (24-11-2016)

Licence

Attribution

Identifiers

Cite

Barbara König, Sebastian Küpper. Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.311-325, ⟨10.1007/978-3-662-44602-7_24⟩. ⟨hal-01402080⟩
195 View
134 Download

Altmetric

Share

Gmail Facebook X LinkedIn More