THE SYNTHESIS OF THE HIERARCHICAL FINITE-STATE CONTROL SYSTEMS
The known methods of Boolean expression synthesis to control the positioning actuators based on the Moore machine and the Karnaugh maps for a large number of input variables and controls present crucial difficulties due to the high dimension of the task. Moreover, the task of constructing the Moore machine for algorithms with long control chains is a difficult one in terms of preventing lock-ups and loops. In this regard, the task of synthesis of finite-state machine devices in high-dimensional tasks should be solved on the basis of the principles of a systematic approach by partitioning the main task into subtasks. The article proposes a method for characterization of forming procedures and sequences of Boolean expressions for calculating controls based on the use of hierarchical Petri nets. It also proposes a method for matching the subnet operation based on matching tokens, which facilitates the development of logical control devices for objects with a large number of input variables and controls.