52 citations · 217 across the 36 of their papers we have counts for
3 papers · 1 filter
Determinization and Limit-determinization of Emerson-Lei automata
Tobias John, Simon Jantsch, Christel Baier +1
We study the problem of determinizing -automata whose acceptance condition is defined on the transitions using Boolean formulas, also known as transition-based Emerson-Lei autom…
From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata
Simon Jantsch, David Müller, Christel Baier +1
This paper proposes a new algorithm for the generation of unambiguous Büchi automata (UBA) from LTL formulas. Unlike existing tableau-based LTL-to-UBA translations, our algorithm d…
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
Christel Baier, Nathalie Bertrand, Marcus Größer
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite i…