LTL reactive synthesis with a few hints

DOI10.1007/978-3-031-30820-8_20MaRDI QIDQ6536136zbMATHFDO

Authors Emmanuel Filiot, Jean-François Raskin

Publication date 5 April 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• Dissecting \texttt{ltlsynt}
• scientific article; zbMATH DE number 2104638
• Synthesis of Reactive(1) designs
• Practical synthesis of reactive systems from LTL specifications via parity games

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1487861 (Why is no real title available?)
• An Antichain Algorithm for LTL Realizability
• Antichains and compositional algorithms for LTL synthesis
• Better Quality in Synthesis through Quantitative Objectives
• Bounded Synthesis
• From LTL and limit-deterministic Büchi automata to deterministic parity automata
• From Spot 2.0 to Spot 2.10: What’s New?
• Graph Games and Reactive Synthesis
• Learning Moore machines from input-output traces
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
• On high-quality synthesis
• Scalable anytime algorithms for learning fragments of linear temporal logic
• Synthesizing non-vacuous systems
• Transforming spreadsheet data types using examples

Cited in

(4)

• Dissecting \texttt{ltlsynt}
• Towards an efficient implementation of a tableau method for reactive safety specifications
• Towards the exact complexity of realizability for safety LTL
• Guessing winning policies in LTL synthesis by semantic learning

This page was built for publication: LTL reactive synthesis with a few hints

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