Abstract
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.
This research was supported in part by the DARPA (NASA) grant NAG2-1214, the DARPA (Wright-Patterson AFB) grant F33615-C-98-3614, the ARO MURI grant DAAH-04-96-1-0341, and the NSF CAREER award CCR-9501708.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
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.
R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116–146, 1996.
E. Asarin, O. Maler, and A. Pnueli. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138:65–66, 1995.
V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control. To appear in Automatica, 1999.
M. Franzle. Analysis of Hybrid Systems: An ounce of realism can save an infinity of states, CSL’99: Computer Science Logic. LNCS 1683, Springer Verlag, 126–140, 1999.
V. Gupta, T.A. Henzinger, and R. Jagadeesan. Robust timed automata, HART 97: Hybrid and Real-time Systems. LNCS 1201, Springer-Verlag, 331–345, 1997.
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.
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.
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.
P. Herrmann. Timed automata and recognizability. Information Processing Letters, 65(6):313–318, 1998.
J.-F. Raskin and P.-Y. Schobbens. The Logic of Event Clocks: Decidability, Complexity, and Expressiveness. Journal of Automata, Languages and Combinatorics, 4(3):247–284, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henzinger, T.A., Raskin, JF. (2000). Robust Undecidability of Timed and Hybrid Systems. In: Lynch, N., Krogh, B.H. (eds) Hybrid Systems: Computation and Control. HSCC 2000. Lecture Notes in Computer Science, vol 1790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46430-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-46430-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67259-3
Online ISBN: 978-3-540-46430-3
eBook Packages: Springer Book Archive