Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 2004 | public
Book Section - Chapter

S.O.S. for safety

Abstract

Verification of continuous systems remains one of the main obstacles in the safety verification of hybrid systems. In this paper, by exploiting the structure of linear dynamical systems, we convert the exact safety verification of linear systems with certain eigen-structure as an emptiness problem for a semi-algebraic set. Sum of squares (SOS) decomposition is then employed to check emptiness of the set defined by polynomial equalities and inequalities which can be effectively computed by semidefinite programming.

Additional Information

© 2004 IEEE. Date of Current Version: 16 May 2005. This research is partially supported by the National Science Foundation Information Technology Research grant CCR01-21431. We thank Ashish Tiwari for very useful comments on this paper and discussions on safety of hybrid systems.

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024