Quantitative Kleene coalgebras

Quantitative Kleene coalgebras,10.1016/j.ic.2010.09.007,Information and Computation/information and Control,Alexandra Silva,Filippo Bonchi,Marcello M.

Quantitative Kleene coalgebras   (Citations: 3)
BibTex | RIS | RefWorks Download
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 (functor) type of these coalgebras.In previous work, we applied a similar approach to a class of systems (without weights) that generalizes both the results of Kleene (on rational languages and DFA’s) and Milner (on regular behaviours and finite LTS’s), and includes many other systems such as Mealy and Moore machines.In the present paper, we extend this framework to deal with quantitative systems. As a consequence, our results now include languages and axiomatizations, both existing and new ones, for many different kinds of probabilistic systems.
Journal: Information and Computation/information and Control - IANDC , vol. 209, no. 5, pp. 822-849, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: