S.O.S. for Safety

Proceedings of the IEEE Conference on Decision and Control

Volumn 1, Issue , 2004, Pages 461-466

  Yazarel, Hakan ^a   Prajna, Stephen ^b   Pappas, George J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DIFFERENTIAL EQUATIONS; EIGENVALUES AND EIGENFUNCTIONS; HAMILTONIANS; LINEAR SYSTEMS; POLYNOMIALS; SET THEORY;

DYNAMICAL SYSTEM STRUCTURE; EIGEN-STRUCTURE; SAFETY VERIFICATION; SUM OF SQUARES (SOS);

SECURITY SYSTEMS;

EID: 14344255958     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1428673     Document Type: Conference Paper

References (15)

1. E. M. Clarke and R. P. Kurshan, "Computer-aided verification," IEEE Spectrum, vol. 33, no. 6, pp. 61-67, 1996.
2. A. Chutinan and B. H. Krogh, "Computational techniques for hybrid system verification," IEEE Transactions on Automatic Control, vol. 48, no. 1, pp. 64-75, Jan. 2003.
3. T. Dang and O. Maler, "Reachability analysis via face lifting," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, T. Henzinger and S. Sastry, Eds. Berlin: Springer Verlag, 1998, vol. 1386, pp. 96-109.
4. A. Kurzhanski and P. Varaiya, "Ellipsoidal techniques for reachability analysis," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, B. Krogh and N. Lynch, Eds. Springer Verlag, 2000, vol. 1790, pp. 203-213.
5. I. Mitchell and C. Tomlin, "Level set methods for computation in hybrid systems," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, B. Krogh and N. Lynch, Eds. Springer Verlag, 2000, vol. 1790, pp. 310-323.
6. H. Yazarel and G. J. Pappas, "Geometric programming relaxations for linear system reachability," in Proceedings of 2004 American Control Conference, ACC'04, Boston, MA, USA, June 2004.
7. H. Anai and V. Weispfenning, "Reach set computations using real quantifier elimination," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, M. D. D. Benedetto and A. L. Sangiovanni-Vincentelli, Eds. Springer Verlag, 2001, vol. 2034, pp. 63-76.
8. G. Lafferriere, G. J. Pappas, and S. Yovine, "Symbolic reachability computations for families of linear vector fields," Journal of Symbolic Computation, vol. 32, no. 3, pp. 231-253, September 2001.
9. A. Tiwari, "Approximate reachability for linear systems," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, O. Maler and A. Pnueli, Eds., vol. 2623. Springer-Verlag, Apr. 2003, pp. 514-525.
10. A. Tarski, A decision method for elementary algebra and geometry, 2nd ed. University of California Press, 1951.
11. P. A. Parrilo, "Structured semidefmite programs and semialgebraic geometry methods in robustness and optimization," Ph.D. dissertation, California Institute of Technology, 2000.
12. S. Prajna, A. Papachristodoulou, and P. A. Parrilo, " IntroducingSOSTOOLS: A general purpose sum of squares programming solver," in Proceedings of the 2002 IEEE Conference on Decision and Control, Las Vegas, Nevada, USA, Dec. 2002. Available at http://www.cds.caltech.edu/sostools and http://www.aut.ee.ethz.ch/parrilo/sostools.
13. G. Stengle, "A nullstellensatz and a positivstellensatz in semialgebraic geometry," Math. Ann., vol. 207, pp. 87-97, 1974.
14. S. Prajna and A. Jadbabaie, "Safety verification of hybrid systems using barrier certificates," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, R. Alur and G. J. Pappas, Eds. Philadelphia, PA, USA: Springer Verlag, March 2004.
15. A. Tiwari and G. Khanna, "Series of abstractions for hybrid automata," in Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, C. Tomlin and M. Greenstreet, Eds., vol. 2289. Stanford, CA, USA: Springer Verlag, April 2002.