RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2018 161, 7 pp. (Mi ipmp2520)

Minimal complete fault detection tests for logic networks in the standard basis

K. A. Popkov


Abstract: For each Boolean function, we find the exact value of minimal possible length of a complete fault detection test for logic networks implementing this function in the basis “conjunction, disjunction, negation” under one-type stuck-at faults at outputs of gates.

Keywords: logic network, one-type stuck-at fault, complete fault detection test.

DOI: 10.20948/prepr-2018-161



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025