29 citations · 29 across the 2 of their papers we have counts for
2 papers
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…
cs.FL2017★ 29 cited
LTL to Deterministic Emerson-Lei Automata
David Müller, Salomon Sickert
We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expr…