Small strategies for safety games

DOI10.1007/978-3-642-24372-1_22MaRDI QIDQ3172922zbMATH OpenOpenAlexFDO

Authors Daniel Neider

Publication date 7 October 2011

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24372-1_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• Playing Safe
• Permissive strategies: from parity games to safety games
• An automaton learning approach to solving safety games over infinite graphs
• Learning of winning strategies for terminal games with linear-size memory
• Synthesising Succinct Strategies in Safety and Reachability Games

Cited in

(11)

• Playing Safe, Ten Years Later
• Playing Safe
• How to win first-order safety games
• Adapting to the behavior of environments with bounded memory
• An automaton learning approach to solving safety games over infinite graphs
• Synthesising succinct strategies in safety games with an application to real-time scheduling
• Learning of winning strategies for terminal games with linear-size memory
• Protective and prudent behaviour in games
• scientific article; zbMATH DE number 2119993 (Why is no real title available?)
• Computing Weakest Strategies for Safety Games of Imperfect Information
• Down the Borel hierarchy: solving Muller games via safety games

This page was built for publication: Small strategies for safety games

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