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

一个定理统摄一切:LTL到ω-自动机的统一翻译

One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata

Javier Esparza, Jan Kretinsky, Salomon Sickert

摘要:

我们提出了一个统一的翻译LTL公式到确定性拉宾自动机,有限确定性Büchi自动机,和不确定性Büchi自动机。翻译产生自动机的渐近最佳大小(双或单指数,分别)。所有三种翻译都是从一个纯粹逻辑性质的主定理推导出来的。主定理将公式的语言分解为语言的正布尔组合,这些语言可以通过初等方法转化为ω-自动机。特别是,Safra的,排名,和断点结构中使用的其他翻译是不需要的。

英文摘要:

We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi automata, and nondeterministic Büchi automata. The translations yield automata of asymptotically optimal size (double or single exponential, respectively). All three translations are derived from one single Master Theorem of purely logical nature. The Master Theorem decomposes the language of a formula into a positive boolean combination of languages that can be translated into ω-automata by elementary means. In particular, Safra's, ranking, and breakpoint constructions used in other translations are not needed.

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

↑