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)
In this paper we present omega, a package of algorithms from the theory of !-automata. It is a growing collection of procedures which at the moment encompasses constructions like: inclusion tests for regular !-languages, conversion of acceptance conditions, Safra's determinization algorithm, construction of strategies in innnite games.