Robust Undecidability of Timed and Hybrid Systems
The algorithmic approach to the analysis of timed and hybrid systems is fundamentally limited by undecidability, of universality in the timed case (where all continuous variables are clocks), and of emptiness in the rectangular case (which includes drifting clocks). Traditional proofs of undecidability encode a single Turing computation by a single timed trajectory. These proofs have nurtured the hope that the introduction of “fuzziness” into timed and hybrid models (in the sense that a system cannot distinguish between trajectories that are sufficiently similar) may lead to decidability. We show that this is not the case, by sharpening both fundamental undecidability results. Besides the obvious blow our results deal to the algorithmic method, they also prove that the standard model of timed and hybrid systems, while not “robust” in its definition of trajectory acceptance (which is affected by tiny perturbations in the timing of events), is quite robust in its mathematical properties: the undecidability barriers are not affected by reasonable perturbations of the model.
KeywordsHybrid System Positive Real Hybrid Automaton Time Automaton Open Slot
Unable to display preview. Download preview PDF.
- [AFH94]R. Alur, L. Fix, and T.A. Henzinger. A determinizable class of timed automata, CAV 94: Computer-aided Verification, LNCS 818, Springer Verlag, 1–13, 1994.Google Scholar
- [BT99]V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control. To appear in Automatica, 1999.Google Scholar
- [HK97]T.A. Henzinger and P.W. Kopke Discrete-time control for rectangular hybrid automata. ICALP 97: Automata, Languages, and Programming. LNCS 1256, Springer-Verlag, 582–593, 1997.Google Scholar
- [HKPV95]T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In 27th Annual Symposium on Theory of Computing, ACM Press, 373–382, 1995.Google Scholar
- [HR99]T.A. Henzinger and J.-F. Raskin. Robust Undecidability of Timed and Hybrid Systems. Technical Report of the Computer Science Department of the University of California at Berkeley, UCB/CSD-99-1073, October 1999.Google Scholar