Sparse Positional Strategies for Safety Games

  title={Sparse Positional Strategies for Safety Games},
  author={R. Ehlers and Daniela Moldovan},
  • R. Ehlers, Daniela Moldovan
  • Published in SYNT 2012
  • Computer Science
  • We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning strategy for one of the players is used as a certificate or as an artefact for further processing in the application. Small such certificates, i.e., strategies that can be written down very compactly, are typically preferred. For safety games, we only need to… CONTINUE READING
    3 Citations
    Applications of automata learning in verification and synthesis
    • 11
    • PDF
    Codensity Games for Bisimilarity
    • 3
    • PDF
    Safraless LTL synthesis considering maximal realizability
    • 12
    • PDF


    Small Strategies for Safety Games
    • 14
    • Highly Influential
    Automata logics, and infinite games: a guide to current research
    • 553
    Bounded synthesis
    • 184
    • PDF
    Symbolic bounded synthesis
    • R. Ehlers
    • Computer Science
    • Formal Methods Syst. Des.
    • 2012
    • 68
    • PDF
    Optimizations for LTL Synthesis
    • 168
    • PDF
    Alternating-time temporal logic
    • 715
    • Highly Influential
    • PDF
    optsat: A Tool for Solving SAT Related Optimization Problems
    • 11
    • Highly Influential
    Formal models and semantics
    • 180
    Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
    • 18
    • PDF