LTL reactive synthesis with a few hints
type: Item
instance of: scholarly article
title: LTL reactive synthesis with a few hints
zbMATH Open document ID: 1547.68408
DOI: 10.1007/978-3-031-30820-8_20
author: Q6176101
author: Emmanuel Filiot
author: Jean-François Raskin
publication date: 2024-04-05T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7827812
MaRDI profile type: Publication
cites work: Q4608660
cites work: Better Quality in Synthesis through Quantitative Objectives
cites work: Graph Games and Reactive Synthesis
cites work: Synthesizing Non-Vacuous Systems
cites work: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
cites work: From Spot 2.0 to Spot 2.10: What’s New?
cites work: From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
cites work: An Antichain Algorithm for LTL Realizability
cites work: Antichains and compositional algorithms for LTL synthesis
cites work: Learning Moore machines from input-output traces
cites work: On High-Quality Synthesis
cites work: Q4494388
cites work: Q4205072
cites work: Scalable anytime algorithms for learning fragments of linear temporal logic
cites work: Bounded Synthesis
cites work: Transforming spreadsheet data types using examples
description: scientific article; zbMATH DE number 7827812