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

增量LTLf综合

Incremental LTLf Synthesis

Giuseppe De Giacomo, Yves Lespérance, Gianmarco Parretti, Fabio Patrizi, Moshe Y. Vardi

AI总结:

本文提出了一种基于辅助数据结构的增量LTLf综合方法,并探讨了基于公式推进的替代方案,证明其在实际应用中的有效性。

摘要:

在本文中,我们研究了增量LTLf综合——一种反应综合的形式,其中目标是逐步在执行过程中给出的。换句话说,当代理接收到新目标时,它已经在为某个目标执行策略:此时,代理必须放弃当前策略,综合出一个新的策略,仍然满足最初的目标,以及新的目标,从当前时刻开始。在本文中,我们正式定义了增量综合的问题,并研究了其解决方案。我们提出了一种解决方案技术,通过利用在自动机构筑期间构建的辅助数据结构,高效地为多个LTLf目标进行增量综合。我们还考虑了一种基于LTLf公式推进的替代解决方案技术。我们证明,尽管公式推进可以生成比原始公式大指数倍的公式,但其最小自动机的大小仍然由原始公式的大小所限制。另一方面,我们证明,如果以简单的方式实现,即每次新目标到来时都重新计算推进LTLf公式的自动机,则基于公式推进的解决方案并不具有竞争力。

英文摘要:

In this paper, we study incremental LTLf synthesis -- a form of reactive synthesis where the goals are given incrementally while in execution. In other words, the protagonist agent is already executing a strategy for a certain goal when it receives a new goal: at this point, the agent has to abandon the current strategy and synthesize a new strategy still fulfilling the original goal, which was given at the beginning, as well as the new goal, starting from the current instant. In this paper, we formally define the problem of incremental synthesis and study its solution. We propose a solution technique that efficiently performs incremental synthesis for multiple LTLf goals by leveraging auxiliary data structures constructed during automata-based synthesis. We also consider an alternative solution technique based on LTLf formula progression. We show that, in spite of the fact that formula progression can generate formulas that are exponentially larger than the original ones, their minimal automata remain bounded in size by that of the original formula. On the other hand, we show experimentally that, if implemented naively, i.e., by actually computing the automaton of the progressed LTLf formulas from scratch every time a new goal arrives, the solution based on formula progression is not competitive.

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

↑