Geodesic
On logic networks allowing short single fault detection tests under arbitrary faults of gates
Prikladnaâ diskretnaâ matematika, no. 1 (2021), pp. 85-100

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

It is proved that one can implement any non-constant Boolean function in $n$ variables by an irredundant logic network in the basis $\{\,\oplus,\neg\}$, containing not more than one dummy input variable and allowing a single fault detection test with length not more than $2n+3$ regarding arbitrary faults of logic gates.
Keywords: logic network, Boolean function, fault, single fault detection test. 
@article{PDM_2021_1_a4,
     author = {K. A. Popkov},
     title = {On logic networks allowing short single fault detection tests under arbitrary faults of gates},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {85--100},
     publisher = {mathdoc},
     number = {1},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2021_1_a4/}
}
TY  - JOUR
AU  - K. A. Popkov
TI  - On logic networks allowing short single fault detection tests under arbitrary faults of gates
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2021
SP  - 85
EP  - 100
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2021_1_a4/
LA  - ru
ID  - PDM_2021_1_a4
ER  - 
%0 Journal Article
%A K. A. Popkov
%T On logic networks allowing short single fault detection tests under arbitrary faults of gates
%J Prikladnaâ diskretnaâ matematika
%D 2021
%P 85-100
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2021_1_a4/
%G ru
%F PDM_2021_1_a4
K. A. Popkov. On logic networks allowing short single fault detection tests under arbitrary faults of gates. Prikladnaâ diskretnaâ matematika, no. 1 (2021), pp. 85-100. http://geodesic.mathdoc.fr/item/PDM_2021_1_a4/