SESCJan 20, 2012

Exact Safety Verification of Hybrid Systems Based on Bilinear SOS Representation

arXiv:1201.4219v233 citations
Originality Incremental advance
AI Analysis

This work addresses safety verification for hybrid systems, which is critical in domains like control and robotics, but it appears incremental as it builds on existing SOS methods with refinements for exactness.

The paper tackles the problem of safety verification for nonlinear hybrid systems by developing a hybrid symbolic-numeric method to compute exact inequality invariants, achieving exact polynomial invariants with rational coefficients through techniques like modified Newton refinement and rational vector recovery.

In this paper, we address the problem of safety verification of nonlinear hybrid systems. A hybrid symbolic-numeric method is presented to compute exact inequality invariants of hybrid systems efficiently. Some numerical invariants of a hybrid system can be obtained by solving a bilinear SOS programming via PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants with rational coefficients, which {\it exactly} satisfy the conditions of invariants. Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes