Quantitative Kleene coalgebras

  title={Quantitative Kleene coalgebras},
  author={Alexandra Silva and Filippo Bonchi and Marcello M. Bonsangue and Jan J. M. M. Rutten},
  journal={Inf. Comput.},
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are represented as coalgebras and (1) and (2) above are derived in a modular fashion from the underlying… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 21 extracted citations


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

Representation of events in nerve nets and finite automata

Stephen Kleene
Automata Studies, • 1956
View 20 Excerpts
Highly Influenced

Bisimulation relations for weighted automata

Theor. Comput. Sci. • 2008
View 7 Excerpts
Highly Influenced

Probabilistic Verification by Tableaux

View 10 Excerpts
Highly Influenced

Quantifying the Dynamic Behavior of Process Algebras

View 4 Excerpts
Highly Influenced

An Algebra for Kripke Polynomial Coalgebras

2009 24th Annual IEEE Symposium on Logic In Computer Science • 2009
View 8 Excerpts

Structural Operational Semantics for Weighted Transition Systems

Semantics and Algebraic Specification • 2009
View 1 Excerpt

Similar Papers

Loading similar papers…