Engineering an LTLf Synthesis Tool
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909674791501824 |
|---|---|
| author | Duret-Lutz, Alexandre Zhu, Shufang Piterman, Nir de Giacomo, Giuseppe Vardi, Moshe Y |
| author_facet | Duret-Lutz, Alexandre Zhu, Shufang Piterman, Nir de Giacomo, Giuseppe Vardi, Moshe Y |
| contents | The 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02491 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Engineering an LTLf Synthesis Tool Duret-Lutz, Alexandre Zhu, Shufang Piterman, Nir de Giacomo, Giuseppe Vardi, Moshe Y Formal Languages and Automata Theory The 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. |
| title | Engineering an LTLf Synthesis Tool |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2507.02491 |