We consider logic networks over an arbitrary complete finite basis. As faults of gates we permit arbitrary stuck-at faults at outputs of gates. We describe the method of synthesis which allows someone to implement an arbitrary Boolean function on n variables by a network permitting a complete fault detection test which length does not exceed 2n/2 by order.

logic networks, stuck-at faults at outputs of gates, complete fault detection tests

Mathematical problems and theory of numerical methods