Classes of Timed Automata and the Undecidability of Universality
From MaRDI portal
Publication:2842589
DOI10.1016/S1571-0661(04)80479-1zbMath1270.68148MaRDI QIDQ2842589
Guilherme A. Pinto, Arnaldo Vieira Moura
Publication date: 15 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Propositional dynamic logic of nonregular programs
- On verifying that a concurrent program satisfies a nondeterministic specification
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- A theory of timed automata
- Symbolic model checking for real-time systems
- Classes of Timed Automata and the Undecidability of Universality
- Nondeterministic Ω-Computations and the Analytical Hierarchy
- The complexity of probabilistic verification
- The expressive power of clocks
- Achilles and the tortoise climbing up the arithmetical hierarchy
This page was built for publication: Classes of Timed Automata and the Undecidability of Universality
