On fault detection tests of contact break for contact circuits

We consider the synthesis problem of two-pole contact circuits implementing given Boolean functions and admitting short fault detection test with respect to contact breaks. For each $n$-place Boolean function, we found the smallest possible lengths of the single and complete fault detection tests. In particular, it is shown that such length are not greater than $n$.