插值启发的闭包证书
Interpolation-Inspired Closure Certificates
AI总结:
本文提出插值启发闭包证书,通过多函数联合上界逼近过渡不变量,以验证动态系统对ω-正则属性的安全性。
摘要:
闭包证书是一种过渡不变量形式,用于验证动态系统对ω-正则属性(包括安全性)的验证。类似于闭包证书,最近的研究探索了闭包证书的概念,即一种过渡不变量形式,用于验证动态系统对ω-正则属性的验证。闭包证书定义在动态系统的状态对上,是一种实值函数,其零超水平集表征系统的归纳过渡不变量。通过假设闭包证书属于特定的模板类(例如固定次数的多项式),然后使用优化技术如求和平方(SOS)编程来寻找它,可以有效地自动搜索此类证书。不幸的是,对于固定的模板,可能无法找到此类证书。在这种情况下,必须更改模板,例如增加多项式的次数。在本文中,我们考虑了一种称为插值启发闭包证书的概念。插值启发闭包证书由一组函数组成,这些函数通过首先考虑一步过渡,然后两步,依此类推,直到获得过渡不变量,共同上界逼近过渡不变量。插值启发闭包证书的优势在于,即使对于固定的模板,无法使用标准方法找到单个函数,也可以证明属性。我们提出了SOS编程和场景程序来找到这些函数集,并展示了我们提出的方法在某些案例研究中验证持久性和一般ω-正则规范的有效性。
英文摘要:
Barrier certificates, a form of state invariants, provide an automated approach to the verification of the safety of dynamical systems. Similarly to barrier certificates, recent works explore the notion of closure certificates, a form of transition invariants, to verify dynamical systems against $ω$-regular properties including safety. A closure certificate, defined over state pairs of a dynamical system, is a real-valued function whose zero superlevel set characterizes an inductive transition invariant of the system. The search for such a certificate can be effectively automated by assuming it to be within a specific template class, e.g. a polynomial of a fixed degree, and then using optimization techniques such as sum-of-squares (SOS) programming to find it. Unfortunately, one may not be able to find such a certificate for a fixed template. In such a case, one must change the template, e.g. increase the degree of the polynomial. In this paper, we consider a notion of multiple closure certificates dubbed interpolation-inspired closure certificates. An interpolation-inspired closure certificate consists of a set of functions which jointly over-approximate a transition invariant by first considering one-step transitions, then two, and so on until a transition invariant is obtained. The advantage of interpolation-inspired closure certificates is that they allow us to prove properties even when a single function for a fixed template cannot be found using standard approaches. We present SOS programming and a scenario program to find these sets of functions and demonstrate the effectiveness of our proposed method to verify persistence and general $ω$-regular specifications in some case studies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。