Abstract: We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed B"uchi automata accepting infinite timed words some of these problems are Pi^1_1-hard, hence highly undecidable (located beyond the arithmetical hierarchy).
Recommendations
Cited in
(33)- An undecidable problem for timed automata
- Bounded determinization of timed automata with silent transitions
- A game approach to determinize timed automata
- Untangling the graphs of timed automata to decrease the number of clocks
- Predictive runtime enforcement
- Task automata: Schedulability, decidability and undecidability
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
- Classes of timed automata and the undecidability of universality
- Bounded determinization of timed automata with silent transitions
- Off-line test selection with test purposes for non-deterministic timed automata
- Undecidability over Continuous Time
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
- Highly Undecidable Problems For Infinite Computations
- Undecidability Results for Timed Automata with Silent Transitions
- A survey of timed automata for the development of real-time systems
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Determinisability of register and timed automata
- Formal language properties of hybrid systems with strong resets
- scientific article; zbMATH DE number 7156375 (Why is no real title available?)
- Compositional schedulability analysis of real-time actor-based systems
- An introduction to timed automata
- Automata, Languages and Programming
- Formal Modeling and Analysis of Timed Systems
- Control Strategies for Off-Line Testing of Timed Systems
- CONCUR 2005 – Concurrency Theory
- 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
- State estimation for constant-time labeled automata under dense time
- History-deterministic timed automata
- Timed games and deterministic separability
- Folk theorems on the determinization and minimization of timed automata
This page was built for publication: Undecidable Problems About Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511235)
