Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications

DOI10.1007/3-540-45089-0_3zbMath1279.68221OpenAlexW1588748596MaRDI QIDQ3559788

Patrick Hütten, Wolfgang Thomas, Nico Wallmeier

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)

Related Items (17)

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

This page was built for publication: Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications