LTL reactive synthesis with a few hints

DOI10.1007/978-3-031-30820-8_20zbMATH Open1547.68408MaRDI QIDQ6536136FDOQ6536136

Authors: Emmanuel Filiot, Jean-François Raskin 

Publication date: 5 April 2024

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

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)

Cites Work

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

Cited In (4)

• Dissecting \texttt{ltlsynt}
• Towards the exact complexity of realizability for safety LTL
• Towards an efficient implementation of a tableau method for reactive safety specifications
• 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)