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

无限状态竞技场中的完整LTL合成

Full LTL Synthesis over Infinite-state Arenas

University of Gothenburg(哥德堡大学);Chalmers University of Technology(查尔姆斯理工大学);TU Wien(维也纳工业大学);Dedaub

Shaun Azzopardi, Luca Di Stefano, Nir Piterman, Gerardo Schneider

AI总结:

本研究提出了一种基于布尔抽象的完整LTL目标合成方法,通过CEGAR方法提升无限状态竞技场中的合成效率,优于现有最先进方法。

摘要:

最近,将反应合成应用于比布尔域更丰富的领域引起了越来越多的兴趣。该领域的一个主要(不可判定)挑战是确定当步骤数无界时,某些重复行为何时会终止在期望状态。现有方法对此问题难以应对,或只能处理具有Büchi目标的确定性游戏。本工作突破性地贡献了首个基于布尔抽象的完整LTL目标合成方法,该方法编码了无限竞技场底层的安全性和活性属性。我们采用CEGAR方法:在布尔抽象上尝试合成,通过不变量检查检查抽象反策略的伪性,并根据反例进行抽象细化。我们通过高效的二进制编码将限制于谓词的抽象和合成的复杂性降低了指数级。这还允许我们主动识别有用的公平性属性。我们的离散合成工具在文献中的线性整数算术(LIA)基准上优于当前最先进的方法,能够解决几乎两倍于当前最先进的合成问题。它还比第二名的可实现性检查器在三分之一的时间内解决了略多的问题。我们还引入了其他方法无法处理的更丰富的目标基准,并在这些基准上评估了我们的工具。

英文摘要:

Recently, interest has increased in applying reactive synthesis to richer-than-Boolean domains. A major (undecidable) challenge in this area is to establish when certain repeating behaviour terminates in a desired state when the number of steps is unbounded. Existing approaches struggle with this problem, or can handle at most deterministic games with Büchi goals. This work goes beyond by contributing the first effectual approach to synthesis with full LTL objectives, based on Boolean abstractions that encode both safety and liveness properties of the underlying infinite arena. We take a CEGAR approach: attempting synthesis on the Boolean abstraction, checking spuriousness of abstract counterstrategies through invariant checking, and refining the abstraction based on counterexamples. We reduce the complexity, when restricted to predicates, of abstracting and synthesising by an exponential through an efficient binary encoding. This also allows us to eagerly identify useful fairness properties. Our discrete synthesis tool outperforms the state-of-the-art on linear integer arithmetic (LIA) benchmarks from literature, solving almost double as many syntesis problems as the current state-of-the-art. It also solves slightly more problems than the second-best realisability checker, in one-third of the time. We also introduce benchmarks with richer objectives that other approaches cannot handle, and evaluate our tool on them.

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

↑