Engineering an LTL_f synthesis tool

DOI10.1007/978-3-032-02602-6_10MaRDI QIDQ6861687zbMATH OpenFDO

Authors Alexandre Duret-Lutz, Shufang Zhu, Nir Piterman, Giuseppe De Giacomo, Moshe Y. Vardi

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-02602-6_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Derivatives of Regular Expressions
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Dissecting \texttt{ltlsynt}
• Effective reductions of Mealy machines
• From Spot 2.0 to Spot 2.10: What’s New?
• Graph-Based Algorithms for Boolean Function Manipulation
• One theorem to rule them all: a unified translation of LTL into -automata
• Partial derivatives of regular expressions and finite automaton constructions
• Planning for temporally extended goals.
• Simple linear-time algorithms for minimal fixed points
• Supervisory control and reactive synthesis: a comparative introduction
• Using temporal logics to express search control knowledge for planning
• Verification, Model Checking, and Abstract Interpretation
• Weak, strong, and strong cyclic planning via symbolic model checking

Cited in

(1)

• Translation of semi-extended regular expressions using linear forms

This page was built for publication: Engineering an \(\mathsf{LTL_f}\) synthesis tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861687)