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

Saad Abdullah Alrawaf; Igor Chikalov; Shahid Hussain; Mikhail Moshkov

doi:10.1016/j.dam.2013.08.009

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

Saad Abdullah Alrawaf, Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English (US)
Pages (from-to)	287-291
Number of pages	5
Journal	Discrete Applied Mathematics
Volume	166
DOIs	https://doi.org/10.1016/j.dam.2013.08.009
State	Published - Mar 2014

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2013.08.009

Cite this

@article{dc5148b15a9a498cbc9f5402a255be48,

title = "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. {\textcopyright} 2013 Elsevier B.V. All rights reserved.",

author = "Alrawaf, {Saad Abdullah} and Igor Chikalov and Shahid Hussain and Mikhail Moshkov",

note = "KAUST Repository Item: Exported on 2020-10-01",

year = "2014",

month = mar,

doi = "10.1016/j.dam.2013.08.009",

language = "English (US)",

volume = "166",

pages = "287--291",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

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 -

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

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this