Friedman's question: Detectability of bridging faults in irredundant computational logic networks

DOI10.1080/00207169008803943zbMATH Open0723.94012OpenAlexW1993671445WikidataQ126244459 ScholiaQ126244459MaRDI QIDQ5202145FDOQ5202145

Authors: Ping Liang 

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803943

Recommendations

• The Complexity of Fault Detection Problems for Combinational Logic Circuits
• On logic networks allowing short single fault detection tests under arbitrary faults of gates
• scientific article; zbMATH DE number 3722574
• On the Numerical Complexity of Short-Circuit Faults in Logic Networks
• Short single fault detection tests for logic networks under arbitrary faults of gates
• Detectability verification of probabilistic Boolean networks
• Faulty Logic: Reasoning about Fault Tolerant Programs
• Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates
• scientific article
• scientific article; zbMATH DE number 2019877

zbMATH Keywords

VLSI circuitsbridging faultscombinational logic network

Mathematics Subject Classification ID

Cites Work

• Undetectability of Bridging Faults and Validity of Stuck-At Fault Test Sets
• Detection and Location of Input and Feedback Bridging Faults Among Input and Output Lines
• Bridging and Stuck-At Faults

Cited In (1)

• Detecting I/O and Internal Feedback Bridging Faults

This page was built for publication: Friedman's question: Detectability of bridging faults in irredundant computational logic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202145)