Home
Schedule
Abstract Template
Masters Attendance
Beyond Kleene:AnAlgebraFor(quantitative)RegularBehaviours

Stc
Date: 2010-04-15

Time: 11:45

Room: [[http://www.cs.uu.nl/docs/reach/bbl.php][BBL]] [[http://www.cs.uu.nl/info/plan/bbl.php][023]]

----+++++ Speaker: Alexandra Silva

----+++++ Title: Beyond Kleene: an algebra for (quantitative) regular behaviours

----+++++  Abstract

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&#8217;s) and Milner (on regular behaviours and finite LTS&#8217;s), and includes many other systems such as Mealy and Moore machines.

In the present talk, 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.