arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.11545cs.AI
收藏

不确定性感知信号时序逻辑推理

Uncertainty-Aware Signal Temporal Logic Inference

Arizona State University(亚利桑那州立大学);Ecole Polytechnique(巴黎综合理工学院);Max Planck Institute for Software Systems(马克斯·普朗克软件系统研究所)

Nasim Baharisangari, Jean-Raphaël Gaglione, Daniel Neider, Ufuk Topcu, Zhe Xu

摘要:

时态逻辑推理是以时态逻辑公式的形式从数据中提取系统行为的形式化描述的过程。现有的时序逻辑推理方法大多忽略了数据中的不确定性,这导致此类方法在实际部署中的适用性有限。在本文中,我们首先研究了与系统轨迹相关的不确定性,并将这些不确定性以区间轨迹的形式表示。然后,我们提出了两个不确定性感知的信号时序逻辑(STL)推理方法来分类系统的不期望的行为和期望的行为。而不是分类无数的轨迹,我们分类无限多的区间轨迹内的轨迹。在第一种方法中,我们将强大的语义STL公式相对于区间轨迹量化的利润率,在该利润率的STL公式是满足或违反区间轨迹。第二种方法依赖于第一种学习算法,并利用决策树来推断STL公式,以对给定系统的行为进行分类。所提出的方法也适用于不可分离的数据,通过优化推断STL公式的最坏情况下的鲁棒性。最后,我们在两个案例研究中评估了所提出的算法的性能,与基于采样的基线算法相比,所提出的算法的计算时间减少了四个数量级(对于总共有800个采样轨迹的数据集)。

英文摘要:

Temporal logic inference is the process of extracting formal descriptions of system behaviors from data in the form of temporal logic formulas. The existing temporal logic inference methods mostly neglect uncertainties in the data, which results in limited applicability of such methods in real-world deployments. In this paper, we first investigate the uncertainties associated with trajectories of a system and represent such uncertainties in the form of interval trajectories. We then propose two uncertainty-aware signal temporal logic (STL) inference approaches to classify the undesired behaviors and desired behaviors of a system. Instead of classifying finitely many trajectories, we classify infinitely many trajectories within the interval trajectories. In the first approach, we incorporate robust semantics of STL formulas with respect to an interval trajectory to quantify the margin at which an STL formula is satisfied or violated by the interval trajectory. The second approach relies on the first learning algorithm and exploits the decision tree to infer STL formulas to classify behaviors of a given system. The proposed approaches also work for non-separable data by optimizing the worst-case robustness in inferring an STL formula. Finally, we evaluate the performance of the proposed algorithms in two case studies, where the proposed algorithms show reductions in the computation time by up to four orders of magnitude in comparison with the sampling-based baseline algorithms (for a dataset with 800 sampled trajectories in total).

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

↑