TL;DR
This paper introduces a hybrid explicit-symbolic approach to convert LTLf formulas into DFAs, significantly improving scalability and efficiency in reactive synthesis by overcoming existing bottlenecks.
Contribution
It proposes a novel hybrid state-space representation combining explicit and symbolic methods for LTLf to DFA conversion, addressing scalability issues in reactive synthesis.
Findings
Hybrid approach outperforms existing methods in scalability.
Reduces time and memory consumption during conversion.
Supports larger and more complex specifications.
Abstract
LTLf synthesis is the automated construction of a reactive system from a high-level description, expressed in LTLf, of its finite-horizon behavior. So far, the conversion of LTLf formulas to deterministic finite-state automata (DFAs) has been identified as the primary bottleneck to the scalabity of synthesis. Recent investigations have also shown that the size of the DFA state space plays a critical role in synthesis as well. Therefore, effective resolution of the bottleneck for synthesis requires the conversion to be time and memory performant, and prevent state-space explosion. Current conversion approaches, however, which are based either on explicit-state representation or symbolic-state representation, fail to address these necessities adequately at scale: Explicit-state approaches generate minimal DFA but are slow due to expensive DFA minimization. Symbolic-state representations…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsDirect Feedback Alignment · Feedback Alignment
