A coalgebraic perspective on linear weighted automata

@article{Bonchi2012ACP,
  title={A coalgebraic perspective on linear weighted automata},
  author={Filippo Bonchi and Marcello M. Bonsangue and Michele Boreale and Jan J. M. M. Rutten and Alexandra Silva},
  journal={Inf. Comput.},
  year={2012},
  volume={211},
  pages={77-105}
}
Weighted automata are a generalization of non-determinist ic au omata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of eith er (weighted) bisimilarity or (weighted) language equivalence. Coalgebras provide a categorical framework for the uniform study of state-based systems and their behaviours. In this work, we show that… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS
31 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Stark . On behaviour equivalence for probabilistic i / o automata and its relationship to probabilistic bisimulation

  • W Eugene
  • Kleene Coalgebra
  • 2010

Handbook of Weighted Automata , chapter Model Checking Linear-Time Properties of Probabilistic Systems, pages 213–250

  • Christel Baier, Marcus Größer, Frank Ciesinski
  • Monographs in Theor etical Computer Science…
  • 2009
1 Excerpt

Kari.Handbook of Weighted Automata , chapter Digital Image Compression, pages 213–250

  • Jürgen Albert, Jarkko
  • Monogr aphs in Theoretical Computer Science…
  • 2009

Bisimulation relations for weighted automata

  • J. Juan Francisco Camino
  • Theor . Comput . Sci .
  • 2008

Similar Papers

Loading similar papers…