RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 1996 Volume 8, Issue 3, Pages 111–118 (Mi dm535)

On complete checking tests for quasi-iteration-free switching circuits

Kh. A. Madatyan


Abstract: 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.

UDC: 519.7

Received: 27.12.1994

DOI: 10.4213/dm535


 English version:
Discrete Mathematics and Applications, 1996, 6:5, 483–490

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026