Coalgebraic Semantics of Heavy-Weighted Automata
In this paper we study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be formal power series. As for ordinary weighted automata, the behaviour of heavy-weighted automata is expressed in terms of formal power series. We propose several equivalent definitions for their semantics, including a system of behavioural differential equations (following the approach of coinductive calculus), or an embedding into a coalgebra for the functor \(S\,\times \,(-)^A\), for which the set of formal power series is a final coalgebra. Using techniques based on bisimulations and coinductive calculus, we study how ordinary weighted automata can be transformed into more compact heavy-weighted ones.
- 6.Fortin, M., Bonsangue, M.M., Rutten, J.J.M.M.: Coalgebraic semantics of heavy-weighted automata. Technical report FM-1405, CWI - Amsterdam (2014). http://oai.cwi.nl/oai/asset/22603/22603D.pdf
- 13.Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9(1) (2013)Google Scholar