Primal-dual tests for safety and reachability

S Prajna, Anders Rantzer

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch

20 Citations (SciVal)

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.
Original languageEnglish
Title of host publicationHybrid Systems: Computation and Control (Lecture Notes in Computer Science)
PublisherSpringer
Pages542-556
Volume3414
ISBN (Print)978-3-540-25108-8
DOIs
Publication statusPublished - 2005

Publication series

Name
Volume3414
ISSN (Print)1611-3349
ISSN (Electronic)0302-9743

Subject classification (UKÄ)

  • Control Engineering

Fingerprint

Dive into the research topics of 'Primal-dual tests for safety and reachability'. Together they form a unique fingerprint.

Cite this