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

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

Research output: Contribution to journalArticlepeer-review

2 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 languageEnglish (US)
Pages (from-to)287-291
Number of pages5
JournalDiscrete Applied Mathematics
Volume166
DOIs
StatePublished - Mar 2014

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Diagnosis of constant faults in iteration-free circuits over monotone basis'. Together they form a unique fingerprint.

Cite this