Diagnosis of constant faults in iteration-free circuits over monotone basis

Abstract
We show that for each iteration-free combinatorial circuit S over a basis B containing only monotone Boolean functions with at most five variables, there exists a decision tree for diagnosis of constant faults on inputs of gates with depth at most 7L(S) where L(S) is the number of gates in S. © 2013 Elsevier B.V. All rights reserved.

Citation
Alrawaf, S., Chikalov, I., Hussain, S., & Moshkov, M. (2014). Diagnosis of constant faults in iteration-free circuits over monotone basis. Discrete Applied Mathematics, 166, 287–291. doi:10.1016/j.dam.2013.08.009

Publisher
Elsevier BV

Journal
Discrete Applied Mathematics

DOI
10.1016/j.dam.2013.08.009

Permanent link to this record