most citedEffective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.FL2017

Backward deterministic and weak alternating -automata

Sebastian Preugschat, Thomas Wilke

We present a direct transformation of weak alternating -automata into equivalent backward deterministic -automata and show (1) how it can be used to obtain a transformation o…

cs.FL2013★ 2 cited

Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata

Preugschat Sebastian, Thomas Wilke

We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain. The framework is based…