No abstract

No abstract

We consider the synthesis of a reactive module with input x and output y, which is specified by the linear temporal formula ~(2, y). We show that there exists a program satisfying 'P iff the branching time formula (Vx)(Zly)A~(z, y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm for constructing the program whenever it exists. The algorithm is based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in the number of states. This leads to a synthesis algorithm whose complexity is double exponential in the length of the given specification.

No abstract

No abstract