Communication Dans Un Congrès Année : 2025

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.

Fichier principal
Vignette du fichier
main.pdf (831.47 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
DOI

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

Dates et versions

hal-05141145 , version 1 (02-07-2025)

Licence

Identifiants

Citer

Alexandre Duret-Lutz, Shufang Zhu, Nir Piterman, Giuseppe de Giacomo, Moshe Y Vardi. Engineering an LTLf Synthesis Tool. 29th International Conference on Implementation and Applications of Automata (CIAA'25), Sep 2025, Palermo, Italy. pp.129-147, ⟨10.1007/978-3-032-02602-6_10⟩. ⟨hal-05141145⟩
44 Consultations
135 Téléchargements

Altmetric

Partager

  • More