Engineering an LTLf Synthesis Tool
By: Alexandre Duret-Lutz , Shufang Zhu , Nir Piterman and more
Potential Business Impact:
Builds smart machines that always follow rules.
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.
Similar Papers
First-Order LTLf Synthesis with Lookback (Extended Version)
Logic in Computer Science
Makes smart systems understand past events.
A Compositional Framework for On-the-Fly LTLf Synthesis
Artificial Intelligence
Makes computer programs follow complex rules better.
A Compositional Framework for On-the-Fly LTLf Synthesis
Artificial Intelligence
Helps computers make better decisions from rules.