LTL reactive synthesis with a few hints

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

Emmanuel Filiot, Author name not available (Why is that?), 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)

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
• Title not available (Why is that?)
• From Spot 2.0 to Spot 2.10: What’s New?
• Scalable anytime algorithms for learning fragments of linear temporal logic

Cited In (2)

• Towards the exact complexity of realizability for safety LTL
• Towards an efficient implementation of a tableau method for reactive safety specifications

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)