A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
We address the problem of automatically synthesizing digital designs from lineartime specifications. We consider various classes of specifications that can be synthesized with effort quadratic in the number of states of the reactive system, where we measure effort in symbolic steps. The synthesis algorithm is based on a novel type of game called General Reactivity of rank 1 (gr(1)), with a winning condition of the form where each p i and q i is a Boolean combination of atomic propositions. Wedoi:10.1016/j.jcss.2011.08.007 fatcat:ws52wlxjeremjpw44jedi4ngqq