Synthesis of Reactive(1) designs

Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, Yaniv Sa'ar
2012 Journal of computer and system sciences (Print)  
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. We
more » ... ow symbolic algorithms to solve this game, to build a winning strategy and several ways to optimize the winning strategy and to extract a system from it. We also show how to use gr(1) games to solve the synthesis of ltl specifications in many interesting cases. As empirical evidence to the generality and efficiency of our approach we include a significant case studie. We describe the formal specifications and the synthesis process applied to a bus arbiter, which is a realistic industrial hardware specification of modest size.
doi:10.1016/j.jcss.2011.08.007 fatcat:ws52wlxjeremjpw44jedi4ngqq