Automata system: determinism conditions and testing
The problem of testing of aggregate systems is considered. The system components are described with finite automata with multiple entries and exits. The communication between automata is described with message passing over simplex communication channels. The system is described with an oriented grap...
Main Authors: | Igor Burdonov, Alexander Kossatchev |
---|---|
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/32 |
Similar Items
-
Testing of automata system
by: I. B. Burdonov, et al.
Published: (2018-10-01) -
Automata system: composition according to graph of links
by: I. B. Burdonov, et al.
Published: (2018-10-01) -
Graph Learning by a Set of Automata. The Nondeterministic Case
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Parallel Calculations on Dynamic Graph
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Monitoring of dynamically changed graph
by: Igor Burdonov, et al.
Published: (2018-10-01)