|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2001, Volume 8, Issue 3, Pages 46–72
(Mi da225)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On conditional tests for the control of automata networks
V. N. Noskov Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We consider a representation of a finite automaton by a scheme in a basis consisting of strongly connected finite Mealy automata. We present a method for transforming any part of an arbitrary scheme into a subscheme for which diagnosis is possible using conditional tests with good localization of a wide class of faults that arise. We describe test sequences and obtain estimates for their lengths. We give upper bounds for the complexity of the transformed schemes.
Received: 11.04.2001
Citation:
V. N. Noskov, “On conditional tests for the control of automata networks”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001), 46–72
Linking options:
https://www.mathnet.ru/eng/da225 https://www.mathnet.ru/eng/da/v8/s1/i3/p46
|
Statistics & downloads: |
Abstract page: | 292 | Full-text PDF : | 77 |
|