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.
University of Oxford, UK(牛津大学);University of Liverpool, UK(利物浦大学);University of Gothenburg and Chalmers University of Technology, Sweden(哥德堡大学和查尔姆斯理工大学)
Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
University of Liverpool, UK(利物浦大学);Sapienza University of Rome, Italy(罗马大学);University of Oxford, UK(牛津大学);University of Gothenburg and Chalmers University of Technology, Sweden(哥德堡大学和查尔姆斯理工大学)
Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications
Rice University(莱斯大学);State Key Laboratory of Computer Science(计算机科学国家重点实验室);Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所);University of Chinese Academy of Sciences(中国科学院大学)