О решении уравнений для полуавтоматов с таймаутами относительно операции конкатенации
Equations for automata over the concatenation can be used to check the vulnerability of web services with respect to a number of attacks. The solution to the equation describes the malicious web service inputs and can be used to clean such inputs. Since for a number of web services it is necessary t...
| Published in: | Перспективы развития фундаментальных наук. Т. 7 : сборник научных трудов XX Международной конференции студентов, аспирантов и молодых ученых, 25-28 апреля 2023 г. Т. 7 : IT-технологии и электроника. С. 163-165 |
|---|---|
| Main Author: | |
| Format: | Book Chapter |
| Language: | Russian |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001146838 |
| Summary: | Equations for automata over the concatenation can be used to check the vulnerability of web services with respect to a number of attacks. The solution to the equation describes the malicious web service inputs and can be used to clean such inputs. Since for a number of web services it is necessary to take into account time aspects, in this paper we discuss the problem of solving equations for automata with timeouts over concatenation and propose an approach for solving such equations using appropriate automaton abstractions. |
|---|---|
| Bibliography: | Библиогр.: 5 назв. |
| ISBN: | 9785438711438 9785438711360 |