An Undecidable Problem for Timed Automata |
| |
Authors: | Anuj Puri |
| |
Affiliation: | (1) Bell Laboratories, Murray Hill, NJ, 07974 |
| |
Abstract: | The reachability problem for timed automata is decidable when the coefficients in the guards are rational numbers. We show that the reachability problem is undecidable when the coefficients are chosen from the set
. A consequence of this is that the parameter synthesis problem for timed automata with even a single parameter is undecidable. We discuss why such undecidability results arise in timed and hybrid systems, what they mean, and if it is possible to get around them. |
| |
Keywords: | timed systems hybrid systems decidability |
本文献已被 SpringerLink 等数据库收录! |
|