Taming Large Bounds in Synthesis from Bounded-Liveness Specifications (Full Version)

Abstract

Automatic synthesis from temporal logic specifications is an attractive alternative to manual system design, due to its ability to generate correct-by-construction implementations from high-level specifications. Due to the high complexity of the synthesis problem, significant research efforts have been directed at developing practically efficient approaches for restricted specification language fragments. In this paper we focus on the Safety LTL fragment of Linear Temporal Logic (LTL) syntactically extended with bounded temporal operators. We propose a new synthesis approach with the primary motivation to solve efficiently the synthesis problem for specifications with bounded temporal operators, in particular those with large bounds. The experimental evaluation of our method shows that for this type of specifications it outperforms state-ofart synthesis tools, demonstrating that it is a promising approach to efficiently treating quantitative timing constraints in safety specifications.

Taming Large Bounds in Synthesis from Bounded-Liveness Specifications

“…All times are wall-clock times. A detailed description of the benchmarks is given in the full version [13].…”

“…We note, however, that in the worst case it is not possible to avoid this blowup. This is stated in the next theorem, the proof of which is given in the full version [13].…”

“…To complete the construction of the countdown-timer game, we define the set of unsafe locations as UNSAFE L = {⊥}. The proof of the correctness theorem below is given in the full version [13].…”

“…For instance, we combine explicit expansion with timerbased implicit expansion, which allows us to handle directly operators like single . We also use approximation to handle simple assumptions of the form ψ where ψ is fully bounded, i.e., without W. Details can be found in the full version [13].…”