Undecidable Problems About Timed Automata

DOI10.1007/11867340_14zbMath1141.68433arXiv0712.1363OpenAlexW2156016854MaRDI QIDQ3511235

Olivier Finkel

Publication date: 8 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.1363

zbMATH Keywords

decision problemstimed Büchi automatatimed automatadeterminizabilitycomplementabilityuniversality problemshuffle operationminimization of the number of clockstimed regular \((\omega )\)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35)

Related Items

Control Strategies for Off-Line Testing of Timed Systems ⋮ Untangling the graphs of timed automata to decrease the number of clocks ⋮ Predictive runtime enforcement ⋮ Bounded Determinization of Timed Automata with Silent Transitions ⋮ A survey of timed automata for the development of real-time systems ⋮ Control strategies for off-line testing of timed systems ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ An efficient customized clock allocation algorithm for a class of timed automata ⋮ Bounded determinization of timed automata with silent transitions ⋮ Timed Automata with Integer Resets: Language Inclusion and Expressiveness ⋮ Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata ⋮ Compositional schedulability analysis of real-time actor-based systems ⋮ A game approach to determinize timed automata ⋮ Formal language properties of hybrid systems with strong resets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions ⋮ Highly Undecidable Problems For Infinite Computations ⋮ An Introduction to Timed Automata