Синтез перевіряючих тестів на основі циклічних відмітних послідовностей

Abstract

The author on the basis of theoretical generalization and work in the field of test diagnostics, namely the functional approach and the use of automatic models of grid cells, presents a method for the synthesis of testing tests for a homogeneous network with observable outputs, in which the automatic cell models have distinctive sequences and are strongly connected automata. The strongly coupled property of the network model of the network cell simplifies the procedure for finding a set of tests that verify the correctness of the transition in all cells of a one-dimensional network.The lower and upper limits of the length of the full test test are detected, which reveals a set of constant cell faults, a subclass of jumpers and short circuits, entanglements and inversions that do not increase the number of cell states of a homogeneous network.An algorithm is developed for the generation of test sequences for a homogeneous network with observable outputs, the cell of which is inscribed by the transition-output table of a strongly connected automaton having a distinctive sequence. The use of cyclic distinctive sequences obtained in accordance with the developed algorithm to the homogeneous network of the considered class makes it possible to verify the correspondence of the truth table of each cell of the network to the truth table of a valid cell.A scheme of a multi-bit parallel adder with sequential transfer is presented, represented by a homogeneous network with observable outputs, in which each cell performs the function of a complete single-digit adder. In accordance with the algorithm, for each transition, a cyclic distinctive sequence is found and 8 tests are constructed that verify the adder circuit of any dimension. Test kits allow you to detect any malfunction resulting in a distortion of the automatic cell diagram, with the restriction that at the time of testing only one cell of the network is allowed to malfunction.