An undecidable problem for timed automata (Q1300103)

The author investigates the reachability problem for timed automata. He proves that the reachability problem for timed automata in which the coefficients of the guards are from the set \(\{1,\sqrt 2\}\) is undecidable. He introduces counter machines as the vehicle for proving the undecidability result and reduces timed automata with real-valued coefficients into counter machines. Further, the author shows that the parameter synthesis problem for timed automata even in the case of a single parameter is undecidable and he discusses some computational issues for hybrid systems and continuous systems.