Geodesic
On conditional tests for the control of automata networks
Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 3, pp. 46-72

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2001_8_3_a3,
     author = {V. N. Noskov},
     title = {On conditional tests for the control of automata networks},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {46--72},
     publisher = {mathdoc},
     volume = {8},
     number = {3},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2001_8_3_a3/}
}
TY  - JOUR
AU  - V. N. Noskov
TI  - On conditional tests for the control of automata networks
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2001
SP  - 46
EP  - 72
VL  - 8
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2001_8_3_a3/
LA  - ru
ID  - DA_2001_8_3_a3
ER  - 
%0 Journal Article
%A V. N. Noskov
%T On conditional tests for the control of automata networks
%J Diskretnyj analiz i issledovanie operacij
%D 2001
%P 46-72
%V 8
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2001_8_3_a3/
%G ru
%F DA_2001_8_3_a3
V. N. Noskov. On conditional tests for the control of automata networks. Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 3, pp. 46-72. http://geodesic.mathdoc.fr/item/DA_2001_8_3_a3/