Fault detection of parts of combinatorial schemata in automatic bases. (Russian) Zbl 0938.94024

The author presents the further development of the method previously proposed by the author for transforming an arbitrary scheme (or a part of it) into an easily testable form. In contrast to one of the previous articles by the author [see V. N. Noskov, Sib. Zh. Issled. Oper. 3, No. 1, 60-96 (1994; Zbl 0843.94024)], the class of basic elements does not contain only logical but also automatic functions. The class of permitted inaccuracies is reasonably large.
The method transforms an arbitrary selected part \(S\) of a scheme into a scheme \(S'\) and does not change the remaining part. The scheme \(S'\) contains more inputs and outputs than the scheme \(S\) does. Testing makes it possible to diagnose inaccuracies from a given class of inaccuracies.


94C12 Fault detection; testing in circuits and networks
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)


Zbl 0843.94024