1 paper · 1 filter
Slawomir Lasota, Igor Walukiewicz
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of…