DocumentCode :
3159843
Title :
S.O.S. for safety
Author :
Yazarel, Hakan ; Prajna, Stephen ; Pappas, George J.
Author_Institution :
Dept. of Electr. & Syst. Eng., Pennsylvania Univ., Philadelphia, PA, USA
Volume :
1
fYear :
2004
fDate :
17-17 Dec. 2004
Firstpage :
461
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 :
continuous time systems; eigenvalues and eigenfunctions; formal verification; linear systems; polynomials; set theory; time-varying systems; continuous system verification; emptiness problem; hybrid systems; linear dynamical systems; polynomial equalities; safety verification; semi-algebraic set; semidefinite programming; sum of squares decomposition; Calculus; Continuous time systems; Dynamic programming; Ellipsoids; Equations; Linear programming; Linear systems; Optimization methods; Polynomials; Safety;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2004. CDC. 43rd IEEE Conference on
Conference_Location :
Nassau
ISSN :
0191-2216
Print_ISBN :
0-7803-8682-5
Type :
conf
DOI :
10.1109/CDC.2004.1428673
Filename :
1428673
Link To Document :
بازگشت