arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2605.00752eess.SYcs.LOcs.SY
收藏

超证书:针对超LTL规范的离散时间动态系统验证

HyperCertificates: Verification of Discrete-time Dynamical Systems against HyperLTL Specifications

University of Colorado Boulder(科罗拉多大学博尔德分校)

Vishnu Murali, Amin Falah, Ashutosh Trivedi, Majid Zamani

AI总结:

本文提出一种归纳框架,通过超证书概念验证离散时间动态系统 against 超LTL规范。方法结合前瞻函数与屏障函数,利用闭包证书和SOS/SMT技术实现自动验证。

摘要:

我们引入一种归纳框架,通过超证书概念验证离散时间动态系统 against 超LTL规范。不同于线性时序逻辑(LTL)关注单条轨迹,超属性关注轨迹间的关系。超LTL是LTL的扩展,用于描述如透明性、隐私和鲁棒性等规范。我们的超证书由两个函数组成,第一个建模前瞻,第二个结合屏障函数和排名函数。通过闭包证书作为前瞻模型,并利用屏障和排名函数论证来保证超LTL公式。我们展示如何通过现有技术如求和平方优化(SOS)和可满足性模理论(SMT)求解器实现自动化。最后,我们在一些案例研究中展示了我们的方法。

英文摘要:

We introduce a functional inductive framework to verify discrete-time dynamical systems against hyperproperties specified as Hyperlinear temporal logic formulae via a notion of HyperCertificates. Unlike linear temporal logic (LTL) formulae which are concerned with individual traces of a system, hyperproperties are properties that are concerned with how the traces of a system relate to one another. HyperLTL is an extension of LTL for hyperproperties, and is useful to describe specifications such as opacity, privacy as well as notions of robustness. Our notion of HyperCertificates consists of a pair of functions, where the first models the lookahead, and the second relies on a combination of barrier and ranking functions. We use closure certificates, to act as a model for this lookahead and then rely on barrier and ranking function arguments modulo this lookahead to provide guarantees against HyperLTL formulae. We demonstrate how our approach is automatable via existing techniques such as sum-of-squares optimization (SOS) and satisfiability modulo theories (SMT) solvers. Finally, we demonstrate our approach on some case studies.

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

↑