Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Applying Learning by Examples for Digital Design Automation
Applied Intelligence
Temporal logics with incommensurable distances are undecidable
Information and Computation
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
| Hi-index | 0.01 |
Thereachability problem for timed automata is decidable when thecoefficients in the guards are rational numbers. We show thatthe reachability problem is undecidable when the coefficientsare chosen from the set \{1,\sqrt{2}\}. A consequenceof this is that the parameter synthesis problem for timed automatawith even a single parameter is undecidable. We discuss why suchundecidability results arise in timed and hybrid systems, whatthey mean, and if it is possible to ’’get around‘‘ them.