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 June 29, 2007 | public
Journal Article Open

Convex Programs for Temporal Verification of Nonlinear Dynamical Systems

Abstract

A methodology for safety verification of continuous and hybrid systems 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 the linear programming duality appearing in the discrete shortest path problem, we show in this paper that reachability of continuous systems can also be verified through convex programming. Several convex programs for verifying safety and reachability, as well as other temporal properties such as eventuality, avoidance, and their combinations, are formulated. Some examples are provided to illustrate the application of the proposed methods. Finally, we exploit the convexity of our methods to derive a converse theorem for safety verification using barrier certificates.

Additional Information

©2007 Society for Industrial and Applied Mathematics. Received by the editors November 15, 2005; accepted for publication (in revised form) September 26, 2006; published electronically June 29, 2007. Preliminary versions of this paper appeared in Hybrid Systems: Computation and Control 2005 and Proceedings of the IFAC World Congress 2005.

Files

PRAsiamjco07.pdf
Files (324.8 kB)
Name Size Download all
md5:7fb741677dc863040e29e778dd547868
324.8 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023