Short fault detection tests of contact break for contact circuits with an additional pole
Кирилл Андреевич Попков · Discrete Mathematics and Applications · 2026
Abstract We consider the problem of synthesis of 3-pole contact circuits with poles A , B , and V implementing given Boolean functions between the poles A and B and admitting short fault detection tests with respect to contact breaks. For each n -place Boolean function and each test pole set containing at least one of the pairs { A , V }, { B , V }, we find the smallest possible lengths of the single and complete fault detection tests. In particular, it is proved that these lengths do not exceed 3.