Skip to main content


Predicate abstraction for reactive synthesis


Adam Christopher Walker and Leonid Ryzhyk



We present a predicate-based abstraction refinement algorithm for solving reactive games. We develop solutions to the key problems involved in implementing efficient predicate abstraction, which previously have not been addressed in game settings: (1) keeping abstractions concise by identifying relevant predicates only, (2) solving abstract games efficiently, and (3) computing and solving abstractions symbolically. We imple- mented the algorithm as part of an automatic device driver syn- thesis toolkit and evaluated it by synthesising drivers for several real-world I/O devices. This involved solving game instances that could not be feasibly solved without using abstraction or using simpler forms of abstraction.

BibTeX Entry

    author           = {Walker, Adam Christopher and Ryzhyk, Leonid},
    month            = oct,
    year             = {2014},
    keywords         = {termite, device drivers, abstraction refinement, predicate abstraction},
    title            = {Predicate Abstraction for Reactive Synthesis},
    booktitle        = {Conference on Formal Methods in Computer-Aided Design},
    address          = { Lausanne, Switzerland}