论文标题

时间逻辑规格的随机系统风险

Risk of Stochastic Systems for Temporal Logic Specifications

论文作者

Lindemann, Lars, Jiang, Lejun, Matni, Nikolai, Pappas, George J.

论文摘要

数据的广泛可用性以及人工智能和机器学习的计算进步有望使许多未来的技术(例如自动驾驶)。尽管这些技术已经有各种各样的成功演示,但重复报告了关键的系统故障。即使很少见,这种系统的失败也会在没有严格的风险评估的情况下对采用的严重障碍。本文为系统的系统和严格风险验证提供了一个框架。我们考虑在信号时间逻辑(STL)中提出的广泛的系统规范,并将系统作为随机过程建模,从而允许离散时间和连续的时间随机过程。然后,我们将STL的鲁棒性风险定义为缺乏鲁棒性失败的风险。由于系统故障通常是由于缺少鲁棒性而引起的,因此对基础数据生成过程中的错误,系统扰动和分配变化引起了动机。在定义中,我们允许一般的风险度量措施,并专注于诸如风险价值和有条件的价值风险等尾巴风险度量。尽管总体上很难计算STL的鲁棒性风险,但我们提出了近似的STL鲁棒性风险,即更易于处理的概念,即较高的STL稳健性风险。我们展示了如何从系统轨迹数据中准确估计的近似STL鲁棒性风险。对于离散时间随机过程,我们显示在哪些条件下,甚至可以精确地计算出近似的STL鲁棒性风险。我们说明了自主驾驶模拟器CARLA中的验证算法,并展示如何在四个神经网络巷中选择最小风险的控制器,以使控制器适用于五个有意义的系统规格。

The wide availability of data coupled with the computational advances in artificial intelligence and machine learning promise to enable many future technologies such as autonomous driving. While there has been a variety of successful demonstrations of these technologies, critical system failures have repeatedly been reported. Even if rare, such system failures pose a serious barrier to adoption without a rigorous risk assessment. This paper presents a framework for the systematic and rigorous risk verification of systems. We consider a wide range of system specifications formulated in signal temporal logic (STL) and model the system as a stochastic process, permitting discrete-time and continuous-time stochastic processes. We then define the STL robustness risk as the risk of lacking robustness against failure. This definition is motivated as system failures are often caused by missing robustness to modeling errors, system disturbances, and distribution shifts in the underlying data generating process. Within the definition, we permit general classes of risk measures and focus on tail risk measures such as the value-at-risk and the conditional value-at-risk. While the STL robustness risk is in general hard to compute, we propose the approximate STL robustness risk as a more tractable notion that upper bounds the STL robustness risk. We show how the approximate STL robustness risk can accurately be estimated from system trajectory data. For discrete-time stochastic processes, we show under which conditions the approximate STL robustness risk can even be computed exactly. We illustrate our verification algorithm in the autonomous driving simulator CARLA and show how a least risky controller can be selected among four neural network lane keeping controllers for five meaningful system specifications.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源