Geodesic
Short single fault detection tests for logic networks under arbitrary faults of gates
Prikladnaâ diskretnaâ matematika, no. 1 (2022), pp. 59-76

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

It was proved that one can implement any non-constant Boolean function in $n$ variables by an irredundant logic network in the basis $\{\,\oplus,\neg\}$, allowing, when $n\geqslant 3$, a single fault detection test with length not more than $6n-10$ relative to arbitrary faults of gates.
Keywords: logic network, Boolean function, fault, single fault detection test. 
@article{PDM_2022_1_a3,
     author = {K. A. Popkov},
     title = {Short single fault detection tests for logic networks under arbitrary faults of gates},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {59--76},
     publisher = {mathdoc},
     number = {1},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2022_1_a3/}
}
TY  - JOUR
AU  - K. A. Popkov
TI  - Short single fault detection tests for logic networks under arbitrary faults of gates
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2022
SP  - 59
EP  - 76
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2022_1_a3/
LA  - ru
ID  - PDM_2022_1_a3
ER  - 
%0 Journal Article
%A K. A. Popkov
%T Short single fault detection tests for logic networks under arbitrary faults of gates
%J Prikladnaâ diskretnaâ matematika
%D 2022
%P 59-76
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2022_1_a3/
%G ru
%F PDM_2022_1_a3
K. A. Popkov. Short single fault detection tests for logic networks under arbitrary faults of gates. Prikladnaâ diskretnaâ matematika, no. 1 (2022), pp. 59-76. http://geodesic.mathdoc.fr/item/PDM_2022_1_a3/