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

从LTL和极限确定Büchi自动机到确定奇偶自动机

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Javier Esparza, Jan Křetínský, Jean-François Raskin, Salomon Sickert

摘要:

一般线性时序逻辑(LTL)目标的控制器综合是一项具有挑战性的任务。标准的方法是通过Safra-Piterman构造将LTL目标转换为确定性奇偶自动机(DPA)。其中一个挑战是DPA的大小,DPA在实践中通常增长非常快,并且可以达到LTL公式长度的两倍指数大小。在本文中,我们描述了一个单一的指数翻译从有限确定性Büchi自动机(LDBA)的DPA,并表明,它可以连接到最近的有效的翻译从LTL到LDBA产生一个双指数,\enquote{Safraless} LTL到DPA建设。我们还报告了一个实现,与SPOT库的比较,以及几组公式的性能,包括2016年SyntComp竞赛的实例。

英文摘要:

Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA, and show that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, \enquote{Safraless} LTL-to-DPA construction. We also report on an implementation, a comparison with the SPOT library, and performance on several sets of formulas, including instances from the 2016 SyntComp competition.

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

↑