Engineering an LTLf Synthesis Tool
Résumé
he problem of LTLf reactive synthesis is to build a transducer, whose output is based on a history of inputs, such that, for every infinite sequence of inputs, the conjoint evolution of the inputs and outputs has a prefix that satisfies a given LTLf specification. We describe the implementation of an LTLf synthesizer that outperforms existing tools on our benchmark suite. This is based on a new, direct translation from LTLf to a DFA represented as an array of Binary Decision Diagrams (MTBDDs) sharing their nodes. This MTBDD-based representation can be interpreted directly as a reachability game that is solved on-the-fly during its construction.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |
![]()
Cite 10.5281/zenodo.15752968 Article Duret-Lutz, A. (2025). Supporting material for ‘Engineering an LTLf Synthetizer Tool’. Zenodo. https://doi.org/10.5281/ZENODO.15752968
Implementation, supporting scripts, detailed benchmark