Geodesic
Complete fault detection tests of length~2 for logic networks under stuck-at faults of gates
Diskretnyj analiz i issledovanie operacij, Tome 25 (2018) no. 2, pp. 62-81

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

We consider the problem of the synthesis of the logic networks implementing Boolean functions of n variables and allowing short complete fault detection tests regarding arbitrary stuck-at faults at the outputs of gates. We prove that there exists a basis consisting of two Boolean functions of at most four variables in which we can implement each Boolean function by a network allowing such a test with length at most 2. Illustr. 1, bibliogr. 33.
Keywords: logic network, stuck-at fault, complete fault detection test. 
@article{DA_2018_25_2_a3,
     author = {K. A. Popkov},
     title = {Complete fault detection tests of length~2 for logic networks under stuck-at faults of gates},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {62--81},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2018_25_2_a3/}
}
TY  - JOUR
AU  - K. A. Popkov
TI  - Complete fault detection tests of length~2 for logic networks under stuck-at faults of gates
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2018
SP  - 62
EP  - 81
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2018_25_2_a3/
LA  - ru
ID  - DA_2018_25_2_a3
ER  - 
%0 Journal Article
%A K. A. Popkov
%T Complete fault detection tests of length~2 for logic networks under stuck-at faults of gates
%J Diskretnyj analiz i issledovanie operacij
%D 2018
%P 62-81
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2018_25_2_a3/
%G ru
%F DA_2018_25_2_a3
K. A. Popkov. Complete fault detection tests of length~2 for logic networks under stuck-at faults of gates. Diskretnyj analiz i issledovanie operacij, Tome 25 (2018) no. 2, pp. 62-81. http://geodesic.mathdoc.fr/item/DA_2018_25_2_a3/