40 citations · 189 across the 15 of their papers we have counts for
4 papers · 1 filter
On the Translation of Automata to Linear Temporal Logic
Udi Boker, Karoliina Lehtinen, Salomon Sickert
While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved in turning automata back to LT…
Certifying DFA Bounds for Recognition and Separation
Orna Kupferman, Nir Lavee, Salomon Sickert
The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to genera…
Certifying Inexpressibility
Orna Kupferman, Salomon Sickert
Different classes of automata on infinite words have different expressive power. Deciding whether a given language can be expressed by an automaton of a desired c…
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…