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

上下文公式的有效性(扩展版)

Validity of contextual formulas (extended version)

Javier Esparza, Rubén Rubio

AI总结:

该研究将模态μ-演算等时态逻辑中上下文公式的有效性问题归约为普通公式有效性问题,证明其为EXP完全,且工具可毫秒级验证LTL上下文等价式并生成反例。

摘要:

许多著名的逻辑恒等式自然地以上下文公式之间的等价形式呈现。一个简单的例子是Boole-Shannon展开式$c[p] \equiv (p \wedge c[\mathrm{true}] ) \vee (\neg\\, p \wedge c[\mathrm{false}] )$,其中$c$表示一个可能包含多个“空位”的任意公式(称为上下文),而$c[φ]$表示用公式$φ$“填充”$c$的所有空位后得到的结果。另一个例子是模态$μ$-演算的展开规则$μX. c[X] \equiv c[μX. c[X]]$。\n 我们将模态$μ$-演算作为核心时态逻辑,并且按照常规做法,将上下文公式$φ_1, φ_2$是否满足$φ_1 \equiv φ_2$的问题归约为$φ_1 \leftrightarrow φ_2$是否有效的问题。我们证明,$μ$-演算的一个上下文公式是否对所有上下文都有效的问题,可以归约为普通公式的有效性问题。我们的第一项结果构造了一个典范上下文,使得一个公式对所有上下文都有效当且仅当它对这个特定的上下文有效。然而,得到的普通公式的规模随上下文变量的嵌套深度呈指数增长。在第二项结果中,我们解决了这一问题,从而证明上下文公式的有效性问题是EXP完全的,与普通等价式的情况一致。我们还证明这两项结果同样适用于CTL和LTL。我们以一些实验结果作为论文结尾。具体而言,我们使用自己的实现自动证明了Esparza等人最近为LTL公式规范化提出的6个LTL上下文等价式的正确性。Esparza等人需要数页的手动证明,而我们的工具仅需数毫秒即可完成该工作,并且还能为等价式的错误变体计算反例。

英文摘要:

Many well-known logical identities are naturally written as equivalences between contextual formulas. A simple example is the Boole-Shannon expansion $c[p] \equiv (p \wedge c[\mathrm{true}] ) \vee (\neg\, p \wedge c[\mathrm{false}] )$, where $c$ denotes an arbitrary formula with possibly multiple occurrences of a "hole", called a context, and $c[φ]$ denotes the result of "filling" all holes of $c$ with the formula $φ$. Another example is the unfolding rule $μX. c[X] \equiv c[μX. c[X]]$ of the modal $μ$-calculus. We consider the modal $μ$-calculus as overarching temporal logic and, as usual, reduce the problem whether $φ_1 \equiv φ_2$ holds for contextual formulas $φ_1, φ_2$ to the problem whether $φ_1 \leftrightarrow φ_2$ is valid . We show that the problem whether a contextual formula of the $μ$-calculus is valid for all contexts can be reduced to validity of ordinary formulas. Our first result constructs a canonical context such that a formula is valid for all contexts if{}f it is valid for this particular one. However, the ordinary formula is exponential in the nesting-depth of the context variables. In a second result we solve this problem, thus proving that validity of contextual formulas is EXP-complete, as for ordinary equivalences. We also prove that both results hold for CTL and LTL as well. We conclude the paper with some experimental results. In particular, we use our implementation to automatically prove the correctness of a set of six contextual equivalences of LTL recently introduced by Esparza et al. for the normalization of LTL formulas. While Esparza et al. need several pages of manual proof, our tool only needs milliseconds to do the job and to compute counterexamples for incorrect variants of the equivalences.

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

↑