Pith. sign in

REVIEW

Lyapunov-Barrier Characterization of Robust Reach-Avoid-Stay Specifications for Hybrid Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.00814 v1 pith:V2THVTMI submitted 2022-11-02 math.DS

Lyapunov-Barrier Characterization of Robust Reach-Avoid-Stay Specifications for Hybrid Systems

classification math.DS
keywords systemshybridlyapunov-barrierreach-avoid-stayspecificationscharacterizationdifferentialdiscretization
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Stability, reachability, and safety are crucial properties of dynamical systems. While verification and control synthesis of reach-avoid-stay objectives can be effectively handled by abstraction-based formal methods, such approaches can be computationally expensive due to the use of state-space discretization. In contrast, Lyapunov methods qualitatively characterize stability and safety properties without any state-space discretization. Recent work on converse Lyapunov-barrier theorems also demonstrates an approximate completeness or verifying reach-avoid-stay specifications of systems modelled by nonlinear differential equations. In this paper, based on the topology of hybrid arcs, we extend the Lyapunov-barrier characterization to more general hybrid systems described by differential and difference inclusions. We show that Lyapunov-barrier functions are not only sufficient to guarantee reach-avoid-stay specifications for well-posed hybrid systems, but also necessary for arbitrarily slightly perturbed systems under mild conditions. Numerical examples are provided to illustrate the main results.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.