S.O.S. for safety
Authors:
- S. PrajnaSPS. Prajna
- G.J. PappasGPG.J. Pappas
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 461-466 Vol.1
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.Keywords
This publication has 13 references indexed in Scilit:
- Safety Verification of Hybrid Systems Using Barrier Certificates2004
- Approximate Reachability for Linear Systems2003
- Computational techniques for hybrid system verificationIEEE Transactions on Automatic Control, 2003
- Series of Abstractions for Hybrid Automata2002
- Symbolic Reachability Computation for Families of Linear Vector FieldsJournal of Symbolic Computation, 2001
- Reach Set Computations Using Real Quantifier Elimination2001
- Level Set Methods for Computation in Hybrid Systems2000
- Reachability analysis via face lifting1998
- Computer-aided verificationIEEE Spectrum, 1996
- A nullstellensatz and a positivstellensatz in semialgebraic geometryMathematische Annalen, 1974