arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.18532cs.LOcs.AIcs.FL
收藏

LTLf+义务的符号合成

Symbolic Synthesis for LTLf+ Obligations

University of Oxford, UK(牛津大学);University of Liverpool, UK(利物浦大学);University of Gothenburg and Chalmers University of Technology, Sweden(哥德堡大学和查尔姆斯理工大学)

Giuseppe De Giacomo, Christian Hagemeier, Daniel Hausmann, Nir Piterman

AI总结:

研究LTLfp中义务属性的合成,通过符号确定性弱自动机实现高效算法,实验表明其效果与LTLf合成相当。

摘要:

我们研究了LTLfp中义务属性的合成,LTLfp是扩展到无限轨迹的LTLf。义务属性是安全和保证(共安全)属性的正布尔组合,属于Manna和Pnueli的时间层次结构的第二层。尽管义务属性在无限轨迹上表达,但保留了LTLf的大部分简洁性。特别是,我们展示了它们可以翻译成由LTLf属性在轨迹前缀上的符号确定性有限自动机(DFA)直接获得的符号确定性弱自动机(DWA)。DWA继承了DFA的许多吸引人的算法特性,包括布尔闭包和多项式时间最小化。此外,我们展示了LTLfp义务属性的合成在理论上高度高效——一旦构造了DWA,可以在线性时间内解决。我们研究了几种符号算法来解决出现在义务属性合成中的DWA游戏,并通过实验评估了它们的有效性。总体而言,结果表明LTLfp义务属性的合成可以几乎与LTLf合成一样有效。

英文摘要:

We study synthesis for obligation properties expressed in LTLfp, the extension of LTLf to infinite traces. Obligation properties are positive Boolean combinations of safety and guarantee (co-safety) properties and form the second level of the temporal hierarchy of Manna and Pnueli. Although obligation properties are expressed over infinite traces, they retain most of the simplicity of LTLf. In particular, we show that they admit a translation into symbolically represented deterministic weak automata (DWA) obtained directly from the symbolic deterministic finite automata (DFA) for the underlying LTLf properties on trace prefixes. DWA inherit many of the attractive algorithmic features of DFA, including Boolean closure and polynomial-time minimization. Moreover, we show that synthesis for LTLfp obligation properties is theoretically highly efficient - solvable in linear time once the DWA is constructed. We investigate several symbolic algorithms for solving DWA games that arise in the synthesis of obligation properties and evaluate their effectiveness experimentally. Overall, the results indicate that synthesis for LTLfp obligation properties can be performed with virtually the same effectiveness as LTLf synthesis.

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

↑