arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.17166cs.LO
收藏

有限迹上的算术时间性质监控

Monitoring Arithmetic Temporal Properties on Finite Traces

Paolo Felli, Marco Montali, Fabio Patrizi, Sarah Winkler

摘要:

我们研究监测的线性时间算术性能对有限的痕迹所产生的一个未知的动态系统。监视状态是通过考虑到目前为止所看到的跟踪前缀及其所有可能的有限长度的未来延续来确定的。这使得监控至少和可满足性和有效性一样困难。迹由一组固定变量到数值的有限赋值序列组成。属性在我们称为ALTLf的逻辑中指定,将LTLf(有限迹上的LTL)与可以进行前瞻的线性算术约束相结合,即,可以在跟踪的多个时刻上比较变量。虽然这种设置的监测问题是不可判定的一般情况下,我们表现出可判定性(a)没有前瞻性的属性,和(b)前瞻性的属性,满足有限总结的抽象,语义条件,研究之前的背景下,模型检验。然后,我们挑出具体的,实际上相关的类的约束保证有限的总结。一个原型实现证明了可行性。

英文摘要:

We study monitoring of linear-time arithmetic properties against finite traces generated by an unknown dynamic system. The monitoring state is determined by considering at once the trace prefix seen so far, and all its possible finite-length, future continuations. This makes monitoring at least as hard as satisfiability and validity. Traces consist of finite sequences of assignments of a fixed set of variables to numerical values. Properties are specified in a logic we call ALTLf, combining LTLf (LTL on finite traces) with linear arithmetic constraints that may carry lookahead, i.e., variables may be compared over multiple instants of the trace. While the monitoring problem for this setting is undecidable in general, we show decidability for (a) properties without lookahead, and (b) properties with lookahead that satisfy the abstract, semantic condition of finite summary, studied before in the context of model checking. We then single out concrete, practically relevant classes of constraints guaranteeing finite summary. Feasibility is witnessed by a prototype implementation.

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

↑