Safety verification of hybrid systems using barrier certificates

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

Volumn 2993, Issue , 2004, Pages 477-492

  Prajna, Stephen ^a   Jadbabaic, Ali ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BARRIER CERTIFICATES; INITIAL CONDITIONS; NOVEL METHODOLOGY; SAFETY VERIFICATION; SEMI-DEFINITE PROGRAMMING; SUM OF SQUARES DECOMPOSITIONS; SYSTEM SAFETY; ZERO LEVEL SET;

HYBRID SYSTEMS;

EID: 35048844766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24743-2_32     Document Type: Article

References (26)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Oliviero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
2. R. Alur, T. Dang, and F. Ivancic. Progress on reachability analysis of hybrid systems using predicate abstraction. In Hybrid Systems: Computation and Control, LNCS 2623, pages 4-19. Springer-Verlag, 2003.
3. H. Anai and V. Weispfenning. Reach set computations using real quantifier elimination. In Hybrid Systems: Computation and Control, LNCS 2034, pages 63-76. Springer-Verlag, 2001.
4. E. Asarin, T. Dang, and O. Maler. The d/dt tool for verification of hybrid systems. In Computer Aided Verification, LNCS 2404, pages 365-370. Springer-Verlag, 2002.
5. A. Bemporad, F. D. Torrisi, and M. Morari. Optimization-based verification and stability characterization of piecewise affine and hybrid systems. In Hybrid Systems: Computation and Control, LNCS 1790, pages 45-58. Springer-Verlag, 2000.
6. O. Botchkarev and S. Tripakis. Verification of hybrid systems with linear differential inclusions using ellipsoidal approximations. In Hybrid Systems: Computation and Control, LNCS 1790, pages 73-88. Springer-Verlag, 2000.
7. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia, PA, 1994.
8. M. S. Branicky. Multiple Lyapunov functions and other analysis tools for switched and hybrid systems. IEEE Trans. Automatic Control, 43(4):475-482, 1998.
9. A. Chutinan and B. H. Krogh. Computational techniques for hybrid system verification. IEEE Trans. Automatic Control, 48(1):64-75, 2003.
10. E. M. Clarke and R. P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61-67, 1996.
11. M. Johansson and A. Rantzer. Computation of piecewise quadratic Lyapunov functions for hybrid systems. IEEE Trans. Automat. Control, 43(4):555-559, 1998.
12. H. K. Khalil. Nonlinear Systems. Prentice-Hall, Inc., Upper Saddle River, NJ, second edition, 1996.
13. A. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In Hybrid Systems: Computation and Control, LNCS 1790, pages 203-213. SpringerVerlag, 2000.
14. G. Lafferriere, G. J. Pappas, and S. Yovine. Symbolic reachability computations for families of linear vector fields. J. Symbolic Computation, 32(3):231-253, 2001.
15. A. Megretski and A. Rantzer. System analysis via integral quadratic constraints. IEEE Trans. Automatic Control, 42(6):819-830, 1997.
16. R. M. Murray (Ed.). Control in an Information Rich World: Report of the Panel on Future Directions in Control, Dynamics, and Systems. SIAM, Philadelphia, PA, 2003. Available at http://www.cds.caltech.edu/~murray/cdspanel
17. A. Papachristodoulou and S. Prajna. On the construction of Lyapunov functions using the sum of squares decomposition. In Proceedings IEEE CDC, 2002.
18. P. A. Parrilo. Structured Semidefinite Programs ana Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, Caltech, Pasadena, CA, 2000.
19. S. Prajna. Barrier certificates for nonlinear model validation. In Proceedings IEEE Conference on Decision and Control, 2003.
20. S. Prajna, A. Papachristodoulou, and P. A. Parrilo. Introducing SOSTOOLS: A general purpose sum of squares programming solver. In Proceedings IEEE CDC, 2002. Available at http://www.cds.caltech.edu/sostools and http://www.aut.ee. ethz.ch/~parrilo/sostools.
21. N. Z. Shor. Class of global minimum bounds of polynomial functions. Cybernetics, 23(6):731-734, 1987.
22. A. Tiwari. Approximate reachability for linear systems. In Hybrid Systems: Computation and Control, LNCS 2623, pages 514-525. Springer-Verlag, 2003.
23. C. J. Tomlin, I. Mitchell, A. M. Bayen, and M. Oishi. Computational techniques for the verification of hybrid systems. Proc. of the IEEE, 91(7):986-1001, 2003.
24. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
25. H. Yazarel and G. Pappas. Geometric programming relaxations for linear systems reachability. Submitted to the American Control Conference, 2004.
26. K. Zhou, J. C. Doyle, and K. Glover. Robust and Optimal Control. Prentice-Hall, Inc., Upper Saddle River, NJ, 1996.