DOI: 10.17587/prin.16.209-216

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

A. V. Yakovlev, Associate Professor, lutikovaolga@mail.ru, D. A. Anikeev, Student, danyanickeev@gmail.com, L. S. Kudinov, Student, goodkud@mail.ru, Bauman Moscow State Technical University, 105005, Moscow, Russian Federation

Corresponding author: Albert V. Yakovlev, Associate Professor, Bauman Moscow State Technical University, 105005, Moscow, Russian Federation, E-mail: lutikovaolga@mail.ru

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.

Keywords: cyclic finite state machine, LD programming basis, marker system, bit recursion method, identification tables, template map

pp. 209—216

For citation:
Yakovlev A. V., Anikeev D. A., Kudinov L. S. Application of the Bit-Recursion Method in Programming Problems of Cyclic Electropneumatic Automata, Programmnaya Ingeneria, 2025, vol. 16, no. 4, pp. 209—216. DOI: 10.17587/prin.16.209-216. (in Russian).

References:

1. IEC 1131-3 Standard (EN6-1131-3, DIN EN6.1131-3). 1993.
2. SIMATIC S5. Standart Function Blocks and Driver Software for Programmable Controllers. SIEMENS Catalog ST57. 1994.
3. Shalyto A. A. Switch technology. Algorithmization and programming of logical control tasks, St. Petersburg, Nauka, 1998, 628 p. (in Russian).
4. Shalyto A. A., Validation of automatic specifications, Scientific and Technical Bulletin of Information Technologies, Mechanics and Optics, 2023, no. 2, pp. 436—438. DOI: 10.17586/2226-1494-2023-23-2-436-438.
5. Orlov V. A. On the implementation of Boolean functions, Bulletin of the Bauman Moscow State Technical University. Ser. "Instrument Engineering", 2014, vol. 94, no. 1, pp. 101—110 (in Russian).
6. Brauer V. Introduction to the theory of finite automata, Moscow, Radio and Communications, 1987, 312 p. (in Russian).
7. Kuznetsov O. P. Theory of algorithmical finite automaton languages. II. Comparison of languages effectiveness-wise, Avtomat. i Telemekh., 1981, no. 4, pp. 156—164 (in Russian).
8. Trudonoshin V. A., Fedoruk V. G. Solving the inverse dynamics problem using universal modeling systems, Bulletin of the Bauman Moscow State Technical University. Ser. "Instrument Engneering", 2014, vol. 94, no. 1, pp. 94-100 (in Russian).
9. Beran L. Ordered sets, Moscow, Nauka, 1991, 62 p. (in Russian).
10. Maltsev A. I. Algorithms and recursive functions, Moscow, Nauka, 1965, 391 p. (in Russian).
11. Devyatkov V. V. Implementation of finite-automaton algorithms by structured programs, Avtomat. i Telemekh., 1981, no. 9, pp. 147—156 (in Russian).
12. Devyatkov V. V. Stack software implementation of control algorithms, Design of logical control devices, Moscow, Nauka Publ., 1984, pp. 208—216 (in Russian).
13. Brit-fiord.ru, available at: https://brit-fiord.ru/language/yazyk-programmirovaniya-fbd-lad.html (date of access 20.07.2024) (in Russian).
14. LAD/STL/FBD programming window, available at: https://strop--snab-ru.turbopages.org/turbo/strop-snab.ru/s/novosti/lad-fbd.html (date of access 20.09.2024) (in Russian).
15. Programming language for relay diagrams, available at: https://vsetehpribory.ru/elektrika/yazyk-programmirovaniya-relejnyh-diagramm (date of access 20.09.2024) (in Russian).