2005/12/08 by Sławomir Lasota, Igor Walukiewicz, Lasota, Slawomir +1 · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0512031
openalex publication_date 2005/12/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 timed languages which is closed under boolean operations and which has an effective presentation. We prove that the complexity of the emptiness problem for alternating timed automata with one clock is non-primitive recursive. The proof gives also the same lower bound for the universality problem for nondeterministic timed automata with one clock. We investigate extension of the model with epsilon-transitions and prove that emptiness is undecidable. Over infinite words, we show undecidability of the universality problem.