4 citations · 8 across the 8 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2021
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…
cs.FL2019
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…