Robust undecidability of timed and hybrid systems?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1790, Issue , 2000, Pages 145-159

  Henzinger, Thomas A ^a   Raskin, Jean François ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; TRAJECTORIES;

ALGORITHMIC APPROACH; ALGORITHMIC METHODS; CONTINUOUS VARIABLES; HYBRID MODEL; MATHEMATICAL PROPERTIES; THE STANDARD MODEL; TIMED TRAJECTORIES; UNDECIDABILITY;

HYBRID SYSTEMS;

EID: 84974712825     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46430-1_15     Document Type: Conference Paper

References (12)

1. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994
2. R. Alur, L. Fix, and T.A. Henzinger. A determinizable class of timed au-tomata, CAV 94: Computer-aided Verification, LNCS 818, Springer Verlag, 1-13, 1994
3. R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146, 1996
4. E. Asarin, O. Maler, and A. Pnueli. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138:65-66, 1995
5. V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control. To appear in Automatica, 1999
6. M. Franzle. Analysis of Hybrid Systems: An ounce of realism can save an in_nity of states, CSL'99: Computer Science Logic. LNCS 1683, Springer Verlag, 126-140, 1999
7. 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
8. T.A. Henzinger and P.W. Kopke Discrete-time control for rectangular hy-brid automata. ICALP 97: Automata, Languages, and Programming. LNCS 1256, Springer-Verlag, 582-593, 1997
9. 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
10. 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
11. P. Herrmann. Timed automata and recognizability. Information Processing Letters, 65(6):313-318, 1998
12. J.-F. Raskin and P.-Y. Schobbens. The Logic of Event Clocks: Decidability, Complexity, and Expressiveness. Journal of Automata, Languages and Combina-torics, 4(3):247-284, 1999.