Reachability verification for hybrid automata

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

Volumn 1386, Issue , 1998, Pages 190-204

  Henzinger, Thomas A ^a   Rusu, Vlad ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

Hybrid automata; Reachability verification; Theorem proving

Indexed keywords

EID: 84957867892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64358-3_40     Document Type: Conference Paper

References (16)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3):181-201, 1996.
4. B. Boigelot, L. Bronne, and S. Rassart. An improved teachability analysis method for strongly linear hybrid systems. In Proce. of the 9th Co,fetence on Computer.Aided Verification, CA V'97, LNCS 1254, pages 167-178. Springer-Verlag, 1997.
5. A. Burgueño and V. Rusu. Task-system analysis using slope-parametric hybrid automata. In Proc. of the 3rd Conference on Parallel Processing, Euro-Par'97, LNCS 1300, pages 1262-1273. Springer-Verlag, 1997.
6. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. of the 6th Conference on Computer-Aided Verification, CA V'94, LNCS 818, pages 55-67. Springer-Verlag, 1994.
7. Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations. Information Processing Lcgers, 40:269-276, 1991.
8. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control, 1998. To appear.
9. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proc. of the 27th Annual ACM Symposium on Theory of Computing, STOC'95, pages 373-382, 1995.
10. N. Halbwachs, Y.-E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In Proc. of the 1st Static Analysis Symposium, SAS'94, LNCS 864, pages 223-237. Springer-Verlag, 1994.
11. M. Jaffe, N. Levenson, M. Heimdahl, and B. Melhart. Software requirements analysis for real-time process-control systems. IEEE Transactions on Software Engineering, 17(3):241-258, 1996.
12. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid systems. In Proc. of the 1st Workshop on Theory of Hybrid Systems, LNCS 736, pages 179-208. Springer-Verlag, 1993.
13. S. Owre, S. Rajah, J.M. Rushby, N. Shankar, and M.K. Srivas. Pvs: Combining specification, proof checking, and model checking. In Proc. of the 8th Conference on Computer-Aided Verification, CAV '96, LNCS 1102, pages 411-414. Springer-Verlag, 1996.
14. O. Roux and V. Rusu. Uniformity for the decidability of hybrid automata. In Proc. of the 3rd Static Analysis Symposium, SAS'96, LNCS 1145, pages 301-316. Springer-Verlag, 1996.
15. Jan Vitt and Josef Hooman. Assertional specification and verification using Pvs of the steam boiler control system. In Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, LNCS 1165, pages 453-472. Springer-Verlag, 1996.
16. G. M. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer-Verlag, 1995.