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

一个用于线性时序逻辑规范化的简单重写系统

A Simple Rewrite System for the Normalization of Linear Temporal Logic

Javier Esparza, Ruben Rubio, Salomon Sickert

AI总结:

针对现有LTL规范化过程路径复杂或最佳情况仍为指数时间的问题,本文提出一种基于简单重写规则集合的替代规范化过程。

摘要:

在20世纪80年代中期,Lichtenstein、Pnueli和Zuck证明了Past LTL(线性时序逻辑带有过去算子的扩展)的每个公式都等价于形如$\mathbf{G}\mathbf{F} φ\vee \mathbf{F}\mathbf{G} ψ$的公式合取,其中$φ$和$ψ$只包含过去算子。若干年后,Chang、Manna和Pnueli为LTL推导出了类似的范式。这两种规范化过程在最坏情况下都具有非初等的膨胀,并且遵循一条复杂路径:从公式到无计数器自动机,再到无星号正则表达式,最后回到公式。2020年,Sickert和Esparza提出了一种直接且纯句法的LTL规范化过程,可产生与Chang、Manna和Pnueli所得范式相似的范式,且只有单指数膨胀,并将其应用于为给定公式构造简洁确定性$ω$-自动机的问题。然而,他们的过程在最佳情况下也具有指数时间复杂度。特别是,对于几乎已经处于范式中的公式,它的表现并不会更好。本文提出了一种基于简单重写规则集合的替代规范化过程。

英文摘要:

In the mid 80s, Lichtenstein, Pnueli, and Zuck showed that every formula of Past LTL (the extension of Linear Temporal Logic with past operators) is equivalent to a conjunction of formulas of the form $\mathbf{G}\mathbf{F} φ\vee \mathbf{F}\mathbf{G} ψ$, where $φ$ and $ψ$ contain only past operators. Some years later, Chang, Manna, and Pnueli derived a similar normal form for LTL. Both normalization procedures have a non-elementary worst-case blow-up, and follow an involved path from formulas to counter-free automata to star-free regular expressions and back to formulas. In 2020, Sickert and Esparza presented a direct and purely syntactic normalization procedure for LTL yielding a normal form similar to the one by Chang, Manna, and Pnueli, with a single exponential blow-up, and applied it to the problem of constructing a succinct deterministic $ω$-automaton for a given formula. However, their procedure had exponential time complexity in the best case. In particular, it does not perform better for formulas that are almost in normal form. In this paper we present an alternative normalization procedure based on a simple set of rewrite rules.

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

↑