TY - JOUR
T1 - Diagnosis of constant faults in iteration-free circuits over monotone basis
AU - Alrawaf, Saad Abdullah
AU - Chikalov, Igor
AU - Hussain, Shahid
AU - Moshkov, Mikhail
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014/3
Y1 - 2014/3
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/563415
UR - https://linkinghub.elsevier.com/retrieve/pii/S0166218X13003508
UR - http://www.scopus.com/inward/record.url?scp=84893796029&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2013.08.009
DO - 10.1016/j.dam.2013.08.009
M3 - Article
SN - 0166-218X
VL - 166
SP - 287
EP - 291
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -