Geodesic
On complete checking tests for quasi-iteration-free switching circuits
Diskretnaya Matematika, Tome 8 (1996) no. 3, pp. 111-118
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

While using complex logical circuits, of special interest are the questions of controlling the system and tracing and shooting troubles to the components involved. For controlling logical devices it is important to construct minimal tests which can both to determine whether or not the circuit is functioning properly and to recognize the kind and the place of the fault. However, in many cases the practical construction of testing procedures is labour-consuming. In this paper we consider some classes of circuits for which the construction of such tests is considerably simplified due to special features of the circuits.This work was supported by the Grant Centre for Research on Mathematics attached to the Novosibirsk University. 
@article{DM_1996_8_3_a8,
     author = {Kh. A. Madatyan},
     title = {On complete checking tests for quasi-iteration-free switching circuits},
     journal = {Diskretnaya Matematika},
     pages = {111--118},
     year = {1996},
     volume = {8},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1996_8_3_a8/}
}
TY  - JOUR
AU  - Kh. A. Madatyan
TI  - On complete checking tests for quasi-iteration-free switching circuits
JO  - Diskretnaya Matematika
PY  - 1996
SP  - 111
EP  - 118
VL  - 8
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_1996_8_3_a8/
LA  - ru
ID  - DM_1996_8_3_a8
ER  - 
%0 Journal Article
%A Kh. A. Madatyan
%T On complete checking tests for quasi-iteration-free switching circuits
%J Diskretnaya Matematika
%D 1996
%P 111-118
%V 8
%N 3
%U http://geodesic.mathdoc.fr/item/DM_1996_8_3_a8/
%G ru
%F DM_1996_8_3_a8
Kh. A. Madatyan. On complete checking tests for quasi-iteration-free switching circuits. Diskretnaya Matematika, Tome 8 (1996) no. 3, pp. 111-118. http://geodesic.mathdoc.fr/item/DM_1996_8_3_a8/