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

度量时序逻辑的表达能力与监控

On the Expressiveness and Monitoring of Metric Temporal Logic

Hsi-Ming Ho, Joël Ouaknine, James Worrell

AI总结:

本文提出度量时序逻辑(MTL)的扩展,使其在有界及无界时间域上达到与FO[<, +1]相同的表达能力,并据此设计了首个与迹长度无关的稠密实时监控程序。

摘要:

已知度量时序逻辑(MTL)在时间词上解释时,严格弱于序与度量的单子一阶逻辑(FO[<, +1]);即使时间域先验有界,这一结论仍然成立。在本工作中,我们提出了MTL的一种扩展,使其在有界时间词(以及平凡地,在时间有界信号上)具有与FO[<, +1]相同的表达能力。随后,我们证明若允许在公式中使用有理常数$q \in \mathbb{Q}$,则表达完备性在一般(时间无界)情形下也成立。因此,该扩展版本的MTL给出了Kamp定理的确定性实时类比。作为应用,我们为MTL的扩展提出了一种与迹长度无关的监控程序,这是稠密实时设置中的首个此类程序。

英文摘要:

It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded signals). We then show that expressive completeness also holds in the general (time-unbounded) case if we allow the use of rational constants $q \in \mathbb{Q}$ in formulas. This extended version of MTL therefore yields a definitive real-time analogue of Kamp's theorem. As an application, we propose a trace-length independent monitoring procedure for our extension of MTL, the first such procedure in a dense real-time setting.

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

↑