2014-09-01
Coalgebraic semantics of heavy-weighted automata
Publication
Publication
We study heavy-weighted automata, a generalization of weighted automata in which the
weights of the transitions can be any formal power series. We define their semantics in three
equivalent ways, and give some examples of how they can provide a more compact representation
of certain power series than ordinary weighted automata.
| Additional Metadata | |
|---|---|
| CWI | |
| Formal methods [FM] | |
| Organisation | Computer Security |
|
Fortin, M., Bonsangue, M., & Rutten, J. (2014). Coalgebraic semantics of heavy-weighted automata. Formal methods [FM]. CWI. |
|
