Russian Federation
Russian Federation
The paper deals with the problem of synthesizing detection tests for discrete devices with memory represented by a mathematical model of fuzzy automaton. In previously published works methods for solving a similar problem for two types of fuzzy automata (linear and with finite memory) were proposed. These methods were based on the use of their peculiarity that is their function law linearity. In contrast to “linear” automata, this paper considers arbitrary fuzzy automata defined in the form of fuzzy graphs and in tabular form. It is assumed that the fuzzy functioning of the automaton is manifested in the necessity of choosing alternative trajectories of motion at some automaton state transitions. The concept of test construction methods for arbitrary fuzzy automata based on the transformation of the model of a given automaton in the form of a fuzzy graph into a crisp graph is proposed. Such transformation is performed by the algorithm proposed in the paper. It is proved that any fault-detecting test in the resulting crisp graph (automaton) detects unambiguously its corresponding fault in the given fuzzy graph (automaton).
fuzzy automata; fuzzy graphs; transformation of fuzzy automata into crisp ones; methods of synthesis of tests for crisp automata; constant faults; concept of synthesis of detection tests
1. Zadeh L. A. Fuzzy sets / L. A. Zadeh // Information and Control. — 1965. — Vol. 8. — Iss. 3. — Pp. 338–353.
2. Speranskiy D. V. Eksperimenty s nechetkimi avtomatami / D. V. Speranskiy // Avtomatika i telemehanika. — 2015. — № 2. — S. 107–124. — EDN: https://elibrary.ru/TOBFFF
3. Speranskiy D. V. Testirovanie nechetkih lineynyh avtomatov // Izvestiya Saratovskogo universiteta. Seriya «Matematika. Mehanika. Informatika». — 2019. — T. 19. — Vyp. 2. — S. 233–241. — DOI:https://doi.org/10.18500/1816- 9791-2019-192-233-240. — EDN: https://elibrary.ru/JPNAKG
4. Speranskiy D. V. Sintez obnaruzhivayuschih testov dlya nechetkih avtomatov s konechnoy pamyat'yu / D. V. Speranskiy // Vestnik Tomskogo gosudarstvennogo universiteta. — Upravlenie, vychislitel'naya tehnika i informatika. — 2024. — № 66. — S. 120–127. — DOI:https://doi.org/10.17223/19988605/66/12. — EDN: https://elibrary.ru/PLAEMB.
5. Kurbanmagomedov K. D. Analiz povedeniya abstraktnogo nechetkogo avtomata i osnovnye procedury resheniya ustanovochnoy, kontroliruyuschey i diagnostiruyuschey zadach / K. D. Kurbanmagomedov // Izvestiya Dagestanskogo gosudarstvennogo pedagogicheskogo universiteta. — Estestvennye i tochnye nauki. — 2011. — № 1(14). — S. 55–58.
6. Speranskiy D. V. Poisk sostyazaniy signalov v nechetkih asinhronnyh avtomatah / D. V. Speranskiy, S. A. Lunev // Avtomatika na transporte. — 2024. — № 2. — S. 178– 189. — DOI:https://doi.org/10.20295/2412-9186-2024-10-02-178-18. — EDN: https://elibrary.ru/JANKXY.
7. Zakrevskiy A. D. Logicheskie osnovy proektirovaniya diskretnyh ustroystv / A. D. Zakrevskiy, Yu. V. Pottosin, L. D. Cheremisinova. — M.: FIZMATLIT, 2007. — 592 s.
8. Parhomenko P. P. Osnovy tehnicheskoy diagnostiki / P. P. Parhomenko, E. S. Sogomonyan; pod red. P. P. Parhomenko. — M.: Energoizdat, 1981. — 320 s.
9. Skobcov Yu. A. Modelirovanie, testirovanie i diagnostika cifrovyh ustroystv / Yu. A. Skobcov, D. V. Speranskiy, V. Yu. Skobcov. — M.: Nacional'nyy Otkrytyy Universitet «INTUIT», 2012. — 439 s. — EDN: https://elibrary.ru/RYSHKX.
10. Kofman A. Vvedenie v teoriyu nechetkih mnozhestv / A. Kofman. — M.: Radio i svyaz', 1982. — 432 s.
11. Nechetkie mnozhestva v modelyah upravleniya i iskusstvennogo intellekta / Pod red. D. A. Pospelova. — M.: Nauka, 1986. — 312 s.
12. Norvich A. M. Postroenie funkcii prinadlezhnosti i teoriya veroyatnostey. Poslednie dostizheniya: per. s angl. / A. M. Norvich, I. B. Turson; pod red. R. R. Yagera. — M.: Radio i svyaz', 1986. — 408 s.
13. Shopin A. G. Postroenie funkcii prinadlezhnosti nechetkogo mnozhestva i ocenka ego veroyatnostnyh harakteristik / A. G. Shopin // Issledovaniya v Rossii: elektronnyy resurs. — URL: http://zhurnal.ape.relarn/ ru/articles/2003/040.pdf.
14. Gill A. Introduction to the theory of finite — state machine / A. Gill. — Mc Graw-Hill company, 1962. — 207 p.
15. Marcenyuk M. A., Seletkov I. P. Privedenie konechnogo avtomata k nechetkoy kombinacionnoy sheme s blokom pamyati / M. A. Marcenyuk, I. P. Seletkov // Nauchno- tehnicheskie vedomosti SPbGPU. — № 6 (210). — 2014. — . 67–80. — EDN: https://elibrary.ru/TEWVZN
