Geodesic
On fault detection tests of contact break for contact circuits
Diskretnaya Matematika, Tome 29 (2017) no. 4, pp. 66-86

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

We consider the synthesis problem of two-pole contact circuits implementing given Boolean functions and admitting short fault detection test with respect to contact breaks. For each $n$-place Boolean function, we found the smallest possible lengths of the single and complete fault detection tests. In particular, it is shown that such length are not greater than $n$.
Keywords: contact circuit, contact break, single fault detection test, complete fault detection test. 
@article{DM_2017_29_4_a4,
     author = {K. A. Popkov},
     title = {On fault detection tests of contact break for contact circuits},
     journal = {Diskretnaya Matematika},
     pages = {66--86},
     publisher = {mathdoc},
     volume = {29},
     number = {4},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2017_29_4_a4/}
}
TY  - JOUR
AU  - K. A. Popkov
TI  - On fault detection tests of contact break for contact circuits
JO  - Diskretnaya Matematika
PY  - 2017
SP  - 66
EP  - 86
VL  - 29
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2017_29_4_a4/
LA  - ru
ID  - DM_2017_29_4_a4
ER  - 
%0 Journal Article
%A K. A. Popkov
%T On fault detection tests of contact break for contact circuits
%J Diskretnaya Matematika
%D 2017
%P 66-86
%V 29
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2017_29_4_a4/
%G ru
%F DM_2017_29_4_a4
K. A. Popkov. On fault detection tests of contact break for contact circuits. Diskretnaya Matematika, Tome 29 (2017) no. 4, pp. 66-86. http://geodesic.mathdoc.fr/item/DM_2017_29_4_a4/