Symbolic synthesis of finite-state controllers for request-response specifications

DOI10.1007/3-540-45089-0_3MaRDI QIDQ3559788zbMATH OpenOpenAlexFDO

Authors Nico Wallmeier, Patrick Hütten, Wolfgang Thomas

Publication date 7 May 2010

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45089-0_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automata and games for synthesis
• scientific article; zbMATH DE number 1863183
• Better Quality in Synthesis through Quantitative Objectives
• Games for synthesis of controllers with partial observation.
• scientific article; zbMATH DE number 2163041

Cited in

(17)

• Symbolic synthesis of masking fault-tolerant distributed programs
• Quantitative reductions and vertex-ranked infinite games
• Timed games with bounded window parity objectives
• Finite-state strategies in delay games
• The complexity of automated addition of fault-tolerance without explicit legitimate states
• Automata and games for synthesis
• Finite-state strategies in delay games
• Quantitative reductions and vertex-ranked infinite games
• Memory Reduction for Strategies in Infinite Games
• Solving μ-Calculus Parity Games by Symbolic Planning
• Time-Optimal Winning Strategies for Poset Games
• Synthesis of Reactive(1) designs
• Down the Borel hierarchy: solving Muller games via safety games
• Window parity games: an alternative approach toward parity games with time bounds
• Optimal strategies in weighted limit games
• Optimizing Winning Strategies in Regular Infinite Games
• Synthesizing bounded-time 2-phase fault recovery

This page was built for publication: Symbolic synthesis of finite-state controllers for request-response specifications

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