Nils Buhrke

  • Citations Per Year
Learn More
We consider nite-state games as a model of nonterminating reactive computations. A natural type of speciication is given by games with Streett winning condition (corresponding to automata accepting by conjunctions of fairness conditions). We present an algorithm which solves the problem of program synthesis for these speciications. We proceed in two steps:(More)
  • 1