Robust Undecidability of Timed and Hybrid Systems

  title={Robust Undecidability of Timed and Hybrid Systems},
  author={Thomas A. Henzinger and Jean-François Raskin},
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… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 65 extracted citations

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata

2008 23rd Annual IEEE Symposium on Logic in Computer Science • 2008
View 2 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 13 references

Robust Undecidability of Timed and Hybrid Systems

T. A. Henzinger, J.-F. Raskin
Technical Report of the Computer Science Department of the University of California at Berkeley, • 1999

Kopke Discrete - time control for rectangular hybrid automata

T. A. Henzinger, W. P.
ICALP 97 : Automata , Languages , and Programming • 1997

Kopke Discrete-time control for rectangular hybrid automata. ICALP 97: Automata, Languages, and Programming

P.W.T.A. Henzinger
LNCS 1256, • 1997

The bene ts of relaxing punctuality

R. Alur, T. Feder, T. A. Henzinger
Journal of the ACM, • 1996

Similar Papers

Loading similar papers…