arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.00655eess.SYcs.AIcs.SY

通过高斯过程回归对未知动力系统的形式化验证

Formal Verification of Unknown Dynamical Systems via Gaussian Process Regression

University of Colorado(科罗拉多大学);TU Delft(代尔夫特理工大学)

John Skovbekk, Luca Laurenti, Eric Frew, Morteza Lahijanian

AI总结:

本文提出一种基于高斯过程回归的形式化验证框架,用于从含噪数据中学习未知离散时间动力系统,并通过抽象为不确定马尔可夫决策过程及模型检查工具验证其满足时序逻辑规范,复杂度为多项式级。

摘要:

在安全关键场景中利用自主系统,需要在存在不确定性和影响系统动力学的黑箱组件的情况下验证其行为。在本工作中,我们开发了一个框架,用于根据输入-输出数据集,针对时序逻辑规范验证具有未建模动力学和噪声测量的离散时间动力系统。该验证框架采用高斯过程(GP)回归从数据集中学习未知动力学,并将连续空间系统抽象为有限状态、不确定的马尔可夫决策过程(MDP)。这种抽象依赖于空间离散化和转移概率区间,这些区间通过使用再生核希尔伯特空间分析来捕获由于GP回归误差引起的不确定性,以及由离散化引起的不确定性。该框架利用现有的模型检查工具,针对给定的时序逻辑规范验证不确定的MDP抽象。我们确立了将从噪声测量创建的抽象上的验证结果扩展到底层系统的正确性。我们展示了该框架的计算复杂度在数据集大小和离散抽象规模上是多项式的。复杂度分析说明了验证结果质量与处理更大数据集和更精细抽象的计算负担之间的权衡。最后,我们在多个具有线性、非线性和切换动力系统的案例研究中展示了我们的学习和验证框架的有效性。

英文摘要:

Leveraging autonomous systems in safety-critical scenarios requires verifying their behaviors in the presence of uncertainties and black-box components that influence the system dynamics. In this work, we develop a framework for verifying discrete-time dynamical systems with unmodelled dynamics and noisy measurements against temporal logic specifications from an input-output dataset. The verification framework employs Gaussian process (GP) regression to learn the unknown dynamics from the dataset and abstracts the continuous-space system as a finite-state, uncertain Markov decision process (MDP). This abstraction relies on space discretization and transition probability intervals that capture the uncertainty due to the error in GP regression by using reproducible kernel Hilbert space analysis as well as the uncertainty induced by discretization. The framework utilizes existing model checking tools for verification of the uncertain MDP abstraction against a given temporal logic specification. We establish the correctness of extending the verification results on the abstraction created from noisy measurements to the underlying system. We show that the computational complexity of the framework is polynomial in the size of the dataset and discrete abstraction. The complexity analysis illustrates a trade-off between the quality of the verification results and the computational burden to handle larger datasets and finer abstractions. Finally, we demonstrate the efficacy of our learning and verification framework on several case studies with linear, nonlinear, and switched dynamical systems.

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

↑