Geodesic
Complete diagnostic length~$2$ tests for logic networks under inverse faults of logic gates
Informatics and Automation, Complex analysis, mathematical physics, and applications, Tome 301 (2018), pp. 219-224

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

It is proved that any Boolean function can be implemented by a logic network in the basis $\{x\,\\,y\,\\,z,x\oplus y,1\}$ in such a way that this logic network admits a complete diagnostic test of length at most $2$ with respect to inverse faults at the outputs of logic gates. 
@article{TRSPY_2018_301_a15,
     author = {K. A. Popkov},
     title = {Complete diagnostic length~$2$ tests for logic networks under inverse faults of logic gates},
     journal = {Informatics and Automation},
     pages = {219--224},
     publisher = {mathdoc},
     volume = {301},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2018_301_a15/}
}
TY  - JOUR
AU  - K. A. Popkov
TI  - Complete diagnostic length~$2$ tests for logic networks under inverse faults of logic gates
JO  - Informatics and Automation
PY  - 2018
SP  - 219
EP  - 224
VL  - 301
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2018_301_a15/
LA  - ru
ID  - TRSPY_2018_301_a15
ER  - 
%0 Journal Article
%A K. A. Popkov
%T Complete diagnostic length~$2$ tests for logic networks under inverse faults of logic gates
%J Informatics and Automation
%D 2018
%P 219-224
%V 301
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2018_301_a15/
%G ru
%F TRSPY_2018_301_a15
K. A. Popkov. Complete diagnostic length~$2$ tests for logic networks under inverse faults of logic gates. Informatics and Automation, Complex analysis, mathematical physics, and applications, Tome 301 (2018), pp. 219-224. http://geodesic.mathdoc.fr/item/TRSPY_2018_301_a15/