Primaldual tests for safety and reachability
(2005) In Hybrid Systems: Computation and Control (Lecture Notes in Computer Science) 3414. p.542556 Abstract
 A methodology for safety verification using barrier certificates has been proposed recently, Conditions that must be satisfied by a barrier certificate can be formulated as a convex program, and the feasibility of the program implies system safety, in the sense that there is no trajectory starting from a given set of initial states that reaches a given unsafe region. The dual of this problem, i.e., the reachability problem, concerns proving the existence of a trajectory starting from the initial set that reaches another given set. Using insights from convex duality and the concept of density functions, in this paper we show that reachability can also be verified through convex programming. Several convex programs for verifying safety,... (More)
 A methodology for safety verification using barrier certificates has been proposed recently, Conditions that must be satisfied by a barrier certificate can be formulated as a convex program, and the feasibility of the program implies system safety, in the sense that there is no trajectory starting from a given set of initial states that reaches a given unsafe region. The dual of this problem, i.e., the reachability problem, concerns proving the existence of a trajectory starting from the initial set that reaches another given set. Using insights from convex duality and the concept of density functions, in this paper we show that reachability can also be verified through convex programming. Several convex programs for verifying safety, reachability, and other properties such as eventuality are formulated. Some examples are provided to illustrate their applications. (Less)
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/record/238740
 author
 Prajna, S and Rantzer, Anders ^{LU}
 organization
 publishing date
 2005
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 in
 Hybrid Systems: Computation and Control (Lecture Notes in Computer Science)
 volume
 3414
 pages
 542  556
 publisher
 Springer
 external identifiers

 wos:000229036300035
 scopus:24344500489
 ISSN
 16113349
 03029743
 ISBN
 9783540251088
 DOI
 10.1007/b106766
 language
 English
 LU publication?
 yes
 id
 607af536391845908d8db0aec2ec5878 (old id 238740)
 date added to LUP
 20070822 15:17:45
 date last changed
 20171112 03:30:17
@inbook{607af536391845908d8db0aec2ec5878, abstract = {A methodology for safety verification using barrier certificates has been proposed recently, Conditions that must be satisfied by a barrier certificate can be formulated as a convex program, and the feasibility of the program implies system safety, in the sense that there is no trajectory starting from a given set of initial states that reaches a given unsafe region. The dual of this problem, i.e., the reachability problem, concerns proving the existence of a trajectory starting from the initial set that reaches another given set. Using insights from convex duality and the concept of density functions, in this paper we show that reachability can also be verified through convex programming. Several convex programs for verifying safety, reachability, and other properties such as eventuality are formulated. Some examples are provided to illustrate their applications.}, author = {Prajna, S and Rantzer, Anders}, isbn = {9783540251088}, issn = {16113349}, language = {eng}, pages = {542556}, publisher = {Springer}, series = {Hybrid Systems: Computation and Control (Lecture Notes in Computer Science)}, title = {Primaldual tests for safety and reachability}, url = {http://dx.doi.org/10.1007/b106766}, volume = {3414}, year = {2005}, }