Detection and setting problems for schemes of unreliable automata. (Russian) Zbl 0957.94057

The author continues the study on transformation of an arbitrary scheme (or a part of it) into an easily testable form [see V. N. Noskov, Diskretn. Anal. Issled. Oper. Ser. 1 6, No. 1, 44-64 (1999; Zbl 0938.94024)]. The method transforms an arbitrary selected part \(S\) of a scheme into a scheme \(S^\prime\) and does not change the remaining part. The scheme \(S^\prime\) contains more inputs and outputs than the scheme \(S\) does. Testing makes it possible to diagnose inaccuracies of a given class of inaccuracies. If the obtained scheme works correctly then it is possible to move the scheme from one state to another with the help of short input sequences. Upper bounds on the lengths of these input sequences and on the size of the transformed scheme are obtained.


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


Zbl 0938.94024