Dynamic control of control automata of complex discrete automation systems

Methods for controlling control automata with Moore's structural organization and the use of well-known Hamming, Berger, kCn and other correction codes are considered. According to the existing paradigm, reducing the cost of a combinational transition scheme is based on reducing the number of States, decomposing graph schemes of algorithms or transition graphs, and then minimizing Boolean function systems. In the new type of automata proposed by the authors, the number of States is purposefully increased. The address subsystem is defined by introducing an address block of (q) two - input "And" elements, one "OR" element, and an RS trigger. Control of such control automata is implemented using a new equilibrium pCn code from (p) three-digit groups with one unit in the group. In the structure of the self-controlled automaton, an encoder (encoder) is introduced for translating the pCn code into a binary positional code. The proposed method for controlling control automata with pCn codes is much simpler than methods using other known correction codes. The binary equivalent of a three-digit group code is obtained by replacing each three-digit group with two binary digits. This new binary positional code makes it possible to create self-controlled control automata with a simple selfmonitoring procedure. This procedure is fundamentally new and more efficient, which is proved by the results of software and hardware implementation of a new type of control automata.

Keywords

Authors

References