USING THE COMPATIBILITY ANALYSIS OF LOGICAL SPECIFICATIONS OF AUTOMATA TO SOLVE GAME PROBLEMS

摘要

Game models are widely used to solve realizability, synthesis, and verification problems. This article considers an alternative approach to solving these problems on the basis of the concept of compatibility of automata (FSMs) or their logical specifications. The corresponding methods substantially differ from those used in the context of a game. It is shown how to use these methods for the synthesis of a winning strategy in a two-player game that does not relate to the development of reactive systems.