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/

[1] Lupanov O. B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, Izd-vo Mosk. un-ta, Moskva, 1984, 138 pp.

[2] Chegis I. A., Yablonskii S. V., “Logicheskie sposoby kontrolya raboty elektricheskikh skhem”, Trudy MIAN, 51, 1958, 270–360 | MR | Zbl

[3] Yablonskii S. V., “Nadezhnost i kontrol upravlyayuschikh sistem”, Materialy Vsesoyuznogo seminara po diskretnoi matematike i ee prilozheniyam (Moskva, 31 yanvarya–2 fevralya 1984 g.), Izd-vo Mosk. un-ta, Moskva, 1986, 7–12 | MR

[4] Yablonskii S. V., “Nekotorye voprosy nadezhnosti i kontrolya upravlyayuschikh sistem”, Matematicheskie voprosy kibernetiki, no. 1, Nauka, Moskva, 1988, 5–25 | MR

[5] Redkin N. P., Nadezhnost i diagnostika skhem, Izd-vo Mosk. un-ta, Moskva, 1992, 192 pp.

[6] Madatyan Kh. A., “Polnyi test dlya bespovtornykh kontaktnykh skhem”, Problemy kibernetiki, no. 23, Nauka, Moskva, 1970, 103–118 | MR

[7] Redkin N. P., “O polnykh proveryayuschikh testakh dlya kontaktnykh skhem”, Metody diskretnogo analiza v issledovanii ekstremalnykh struktur, no. 39, Izd-vo IM SO AN SSSR, Novosibirsk, 1983, 80–87 | MR

[8] Redkin N. P., “O proveryayuschikh testakh zamykaniya i razmykaniya”, Metody diskretnogo analiza v optimizatsii upravlyayuschikh sistem, no. 40, Izd-vo IM SO AN SSSR, Novosibirsk, 1983, 87–99

[9] Romanov D. S., “O sinteze kontaktnykh skhem, dopuskayuschikh korotkie proveryayuschie testy”, Uchenye zapiski Kazanskogo universiteta. Fiziko-matematicheskie nauki, 156:3 (2014), 110–115

[10] Popkov K. A., “Tests of contact closure for contact circuits”, Discrete Math. Appl., 26:5 (2016), 299–308 | DOI | DOI | MR | Zbl