This paper proposes a new AND-OR graph search framework for synthesis of Linear Temporal Logic on finite traces (LTLf), that overcomes some limitations of previous approaches. Within such framework, I devise a procedure inspired by the Davis-Putnam-Logemann-Loveland (DPLL) algorithm to generate the next available agent-environment moves in a truly depth-first fashion, possibly avoiding exhaustive enumeration or costly compilations. I also propose a novel equivalence check for search nodes based on syntactic equivalence of state formulas. Since the resulting procedure is not guaranteed to terminate, I identify a stopping condition to abort execution and restart the search with state-equivalence checking based on Binary Decision Diagrams (BDD), which I show to be correct. The experimental results show that in many cases the proposed techniques outperform other state-of-the-art approaches.
翻译:本文提出了关于有限轨迹线性时空逻辑(LTLf)合成的新的和OR图形搜索框架,克服了以往方法的一些局限性。在这个框架内,我设计了一个由Davis-Putnam-Logemann-Lovelland(DPLLL)算法(DPLL)启发的程序,以真正深度第一的方式产生下一个可用的物剂-环境移动,可能避免详尽无遗的列举或费用高昂的汇编。我还提出了一个基于国家公式综合等同的搜索节点的新型等值检查。由于由此产生的程序不能保证终止,我确定了中止执行的中止条件,并根据我所证明正确的二进制决定图(BDD)重新开始以状态等值检查。实验结果显示,在许多情况下,拟议的技术优于其他最先进的方法。</s>