arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.09703cs.LOmath.DS
收藏

将归纳不变量编码为屏障证书:通过凸规划差分的综合

Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming

Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen

摘要:

屏障证书通常作为一个归纳不变量,将不安全区域与可达状态集隔离开来,因此被广泛用于证明混合系统在无限时间范围内的安全性。我们提出了一个新的条件障碍证书,称为不变的障碍证书条件,证人无界时间安全的微分动力系统。所提出的条件是获得归纳不变性的最弱可能条件。我们表明,放电不变的障碍证书条件-从而合成不变的障碍证书-可以编码为解决双线性矩阵不等式(BMI)的优化问题。我们进一步提出了一种基于凸规划差分的综合算法,通过求解一系列凸优化问题来逼近BMI问题的局部最优解。该算法被纳入一个分支定界的框架,在一个分而治之的方式搜索全局最优。我们提出了一个弱完整性的结果,我们的方法,即,一个屏障证书保证被发现(在一些温和的假设下),只要存在一个归纳不变(在给定的模板的形式),足以证明系统的安全。基准测试的实验结果表明,我们的方法的有效性和效率。

英文摘要:

A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid systems possibly over an infinite time horizon. We present a novel condition on barrier certificates, termed the invariant barrier-certificate condition, that witnesses unbounded-time safety of differential dynamical systems. The proposed condition is the weakest possible one to attain inductive invariance. We show that discharging the invariant barrier-certificate condition -- thereby synthesizing invariant barrier certificates -- can be encoded as solving an optimization problem subject to bilinear matrix inequalities (BMIs). We further propose a synthesis algorithm based on difference-of-convex programming, which approaches a local optimum of the BMI problem via solving a series of convex optimization problems. This algorithm is incorporated in a branch-and-bound framework that searches for the global optimum in a divide-and-conquer fashion. We present a weak completeness result of our method, namely, a barrier certificate is guaranteed to be found (under some mild assumptions) whenever there exists an inductive invariant (in the form of a given template) that suffices to certify safety of the system. Experimental results on benchmarks demonstrate the effectiveness and efficiency of our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑