A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices

A Kleene-Schützenberger theorem for Lindenmayerian rational power series

A Kleene-Schützenberger Theorem for Weighted Event-Clock Automata

We present a Kleene-Schützenberger-Theorem for weighted event-clock automata, i.e., we show that the class of recognizable timed series coincides with the class of rational timed series. The result generalizes Kleene’s famous theorem and its extensions to the classes of weighted automata and event-clock automata. For proving the theorem, we use the method of a recent work on the class of weight...

A Kleene-Schützenberger Theorem for Weighted Timed Automata

During the last years, weighted timed automata (WTA) have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much resear...

An Overview of Residuated Kleene Algebras and Lattices

1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system for Residuated Kleene Lattices and some reducts 4. Interpreting Kleene algebras with tests 1. Residuated Lattices with iteration This talk is mostly about Residuated Kleene Lattices, which are defined as noncommutative residuated 0,1-lattices expanded with a unary operation * that satisfies x ...

A Kleene iteration for parallelism 1

This paper extends automata-theoretic techniques to unbounded parallel behaviour, as seen for instance in Petri nets. Languages are deened to be sets of (labelled) series-parallel posets | or, equivalently, sets of terms in an algebra with two product operations: sequential and parallel. In an earlier paper , we restricted ourselves to languages of posets having bounded width and introduced a n...