Skip to main content


SAT-based strategy extraction in reachability games


Niklas Een, Alexander Legg, Nina Narodytska and Leonid Ryzhyk

University of California



Reachability games are a useful formalism for the synthesis of reactive systems. Solving a reachability game involves (1) determining the winning player and (2) computing a winning strategy that determines the winning player’s action in each state of the game. State-of-the-art game solving methods employ computationally expensive procedures to compute the strategy. In this work, we present a simple and efficient strategy extraction technique for a class of reachability game solvers. Our algorithm is based on a SAT encoding of an abstraction of the game and uses interpolants to compute the strategy. Game abstractions are generated as intermediate outputs of the main game solver, which determines the winner of the game, and are reused in our algorithm to efficiently construct the strategy. Our experimental results show that our approach performs well on a number of software synthesis benchmarks.

BibTeX Entry

    author           = {Een, Niklas and Legg, Alexander and Narodytska, Nina and Ryzhyk, Leonid},
    month            = jan,
    year             = {2015},
    keywords         = {termite, reactive synthesis, sat, qbf, interpolants},
    title            = {{SAT}-based Strategy Extraction in Reachability Games},
    booktitle        = {AAAI},
    address          = {Austin, TX, USA}


Served by Apache on Linux on seL4.
Served by Apache on Linux on seL4.