V.A. Raikhlin1

1 Kazan National Research Technical University named after A. N. Tupolev (Kazan, Russia)

The article presents an analytical review of many years of research of the author's group on invariably actual problems of simulation of informally given digit automata. It is a continuation of the author's previous publication «Constructive modeling is the relevant approach to the synthesis of complex systems». The problematics of synthesis of digital automata by informal assignment has until recently been a "weak link" in the theory of automata. This review aims to widen the circle of IT specialists familiar with the works of the authors in this field. It aims to stimulate the interest of the scientific community in the use of new automata approaches in solving invariably urgent control problems. The basis of the affected research is taken from the methodology of constructive modeling of systems proposed by the author. The important provision of this methodology is the validity of the introduction of verified postulates as declared laws. Postulating the object definition of an informally given automaton allowed us to develop an effective heuristic approach to its synthesis. The growth of problem complexity makes it necessary to automatize the synthesis procedure, which is associated with a search for an adequate representation of knowledge in an artificial intelligence system. The required is achieved by transforming the considered informal model of automata synthesis into the postulated frame-production model. The expediency of excluding the abstract synthesis stage from the automata modeling process by switching to software models is noted. The introduction of another postulate structures the formation of the knowledge base of such models. The transition to the frame-productive model is rather labor-intensive for the user. It can lead to errors. As a consequence, it is necessary to validate obtained solutions. There are also certain difficulties in the subsequent realization of the sequential scheme. Therefore, it is preferable to create a program model of an informally specified automaton. It is fundamentally possible and reasonable to use automata program models to build various control systems, in particular protection control for small unmanned aerial vehicles. For such devices the classical control algorithms are not always effective, which puts on the agenda the use of artificial intelligence methods for control purposes. This could be the subject of the development of the research presented in this article.

Raikhlin V.A. Constructive modeling is the relevant approach to the synthesis of complex systems. Nonlinear World. 2023.
V. 21. № 2. P. 5-22. DOI: https://doi.org/10.18127/j20700970-202302-01 (In Russian)

1. Rajhlin V.A. Konstruktivnoe modelirovanie – relevantnyj podhod k sintezu slozhnyh sistem. Nelinejnyj mir. 2022. T. 20. № 4. S. 5-21. DOI: https://doi.org/10.18127/j20700970-202204-01 (In Russian).
2. Glushkov V.M. Sintez cifrovyh avtomatov. M.: Fizmatgiz. 1962. 476 s. (In Russian).
3. Ajzerman M.A., Gusev L.A., Tal' A.A. i dr. Logika. Avtomaty. Algoritmy. M.: Fizmatgiz. 1963. 556 s. (In Russian).
4. Kobrinskij N.E., Trahtenbrot B.A. Vvedenie v teoriju konechnyh avtomatov. M.: Fizmatgiz. 1962. 404 s. (In Russian).
5. Melihov A.N. Orientirovannye grafy i konechnye avtomaty. M.: Nauka. 1971. 416 s. (In Russian).
6. Spivak M.A. Algoritm abstraktnogo sinteza avtomatov dlja rasshirennogo jazyka reguljarnyh vyrazhenij. Izvestija AN SSSR. Ser. Tehnicheskaja kibernetika. 1965. № 1.
7. Church A. Application of recursive arithmetic in the theory of computers and automata. Univ. Michigan. 1958. 7 p.
8. Moisil Gr.C. Teoria algebrica a mecanismelor automate. Editura tehnica. Bucuresti. 1959. 703 p.
9. Winston P.H. Artificial intelligence. Addison-Wesley Pub. Co. 1992. 737 p.
10. Huffman D.A. The synthesis of sequential switching circuits. J. Franklin Inst. 1954. V. 257. № 3-4. P. 161–190, 275–303.
11. Samuel H. Caldwell. Switching circuits and logical design. New York: Wiley. 1958. 686 p.
12. Unger S.H. Asynchronous Sequential Switching Circuits. New York: Wiley-Interscience. 1969. 290 p.
13. Rajhlin V.A. Konstruktivnoe modelirovanie sistem. Kazan': Izd-vo «Fən» («Nauka») AN RT. 2005. 304 s. (In Russian).
14. Tejz A., Gribomon P., Julen G. i dr. Logicheskij podhod k iskusstvennomu intellektu: ot modal'noj logiki k logike baz dannyh: Per. s angl. M.: Mir. 1998.  494 s. (In Russian).
15. Raikhlin V.A. Automaton synthesis from a nonformal specification. Cybernetics and Systems Analysis. July 1994. V. 30. Is. 4. P. 496-504.
16. Predstavlenie i ispol'zovanie znanij: Per. s angl. Pod. red. H. Ujeno, M. Isidzuka. M.: Mir. 1989. 220 s. (In Russian).
17. Rajhlin V.A., Morozov A.V. Frejmovo-produkcionnaja model' sinteza avtomatov. Vestnik KGTU im. A.N. Tupo-leva. 2001. № 3. S. 5-13 (In Russian).
18. Morozov A.V. O realizuemosti frejmovoj modeli sinteza avtomatov v instrumental'noj srede SUBD. Vestnik KGTU im. A.N. Tupoleva. 2003. № 2. S. 63–68 (In Russian).
19. Valiullina L.R., Rajhlin V.A. Programmnoe modelirovanie cifrovyh avtomatov po neformal'nomu zadaniju kak osnova ih validacii. Vestnik KGTU im. A.N. Tupoleva. 2011. № 1. S. 164-173 (In Russian).
20. Rajhlin V.A. K voprosu ustranenija riska sboja v sinhronnyh posledovatel'nostnyh shemah. Mikrojelektronika. 1996. № 5.
    S. 392-400 (In Russian).
21. Jeffrey E.F. Friedl. Mastering Regular Expressions. 3rd Edition. O’Reilly Media. 2006. 535 p.
22. Klini S. Predstavlenie sobytij v nervnyh setjah i konechnyh avtomatah. V kn.: Avtomaty: Per. s angl. Pod red. K.Je. Shennona, Dzh. Makkarti. M.: IL. 1956. 404 s. (In Russian).
23. Rajhlin V.A., Fadeev K.A. Formirovanie bazy znanij programmnyh modelej neformal'no zadannyh avtomatov. Vestnik KGTU im. A.N. Tupoleva. 2016. № 1. S. 136-142 (In Russian).
24. Shalyto A.A. Logic Control and "Reactive" Systems: Algorithmization and Programming. Automation and Remote Control. 2001. № 1. P. 1-29.
25. Voronkov Ju.S., Voronkov O.Ju. Miniatjurnye bespilotnye letatel'nye apparaty i osobennosti ih sozdanija. Sovremennye naukoemkie tehnologii. 2013. № 10-1. S. 144-147 (In Russian).