Abstract. Game models have been widely used to solve realizability, synthesis, and verification problems. In this paper, we consider an alternative approach to solving these problems based on the notion of compatibility of automata (FSMs) or their logical specifications. The corresponding methods substantially differ from those used in the game setting. We show how these methods can be used for the synthesis of a winning strategy in a two-player game, which does not relate to the development of reactive systems.

Keywords: specification language L, making automata compatible, synthesis of an automaton, game model, winning strategy.