Graph learning by a set of automata
Graph learning by automata is a basic task in many applications. Among these applications are verification and testing of software and hardware systems, network exploration including Internet and GRID basing on formal models. The system or network model, in the final analysis, is a transition graph...
Main Authors: | Igor Burdonov, Alexander Kosachev |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/790 |
Similar Items
-
Graph Learning by a Set of Automata. The Nondeterministic Case
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Monitoring of dynamically changed graph
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Testing of automata system
by: I. B. Burdonov, et al.
Published: (2018-10-01) -
Automata system: determinism conditions and testing
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Parallel Calculations on Dynamic Graph
by: Igor Burdonov, et al.
Published: (2018-10-01)