A Compositional Framework for On-the-Fly LTLf Synthesis
Yongkang Li, Shengping Xiao, Shufang Zhu, Jianwen Li, Geguang Pu

TL;DR
This paper presents a novel compositional on-the-fly synthesis framework for LTLf that combines existing methods, enabling efficient reactive synthesis for large formulas by integrating composition during game solving and employing pruning strategies.
Contribution
It introduces a new framework that integrates compositional and incremental DFA construction during game solving, improving scalability for large LTLf specifications.
Findings
Solves more instances than existing solvers.
Enables early unrealizability detection.
Offers two effective composition variants.
Abstract
Reactive synthesis from Linear Temporal Logic over finite traces (LTLf) can be reduced to a two-player game over a Deterministic Finite Automaton (DFA) of the LTLf specification. The primary challenge here is DFA construction, which is 2EXPTIME-complete in the worst case. Existing techniques either construct the DFA compositionally before solving the game, leveraging automata minimization to mitigate state-space explosion, or build the DFA incrementally during game solving to avoid full DFA construction. However, neither is dominant. In this paper, we introduce a compositional on-the-fly synthesis framework that integrates the strengths of both approaches, focusing on large conjunctions of smaller LTLf formulas common in practice. This framework applies composition during game solving instead of automata (game arena) construction. While composing all intermediate results may be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
