Abstract:
The paper is devoted to a procedure for design of a checking test for a class of multiple constant faults in an asynchronous tree – like logical network with memory. The memory is constructed on single loop and flip-flop. The test recognizes the possible effect of races in the nodes of an operable and inoperable network and does not require simulation for checking.