Application of the Bit-Recursion Method in Programming Problems of Cyclic Electropneumatic Automata

To intensify the programming of technological processes implemented by cyclic finite automata, a bit-recursion method has been developed based on extending the property of simple mathematical recursion to a system of Boolean functions as a general algorithmic basis for logical programming. The proposed mathematical model of the kinematic state of an automaton using markers — program elements of bit recursion — expands the well-known programming methodology by structuring the synthesized LD program. It is shown that recursion connects a triad of sets related respectively to markers, a sensor, and relay electromagnets controlling the actuators of a cyclic automaton. An LD template card has been developed to complement the programmer's interface.