Short single fault detection tests for logic networks under arbitrary faults of gates

DOI10.17223/20710410/55/4zbMath1490.94086OpenAlexW4285257033MaRDI QIDQ5071224

Kirill A. Popkov

Publication date: 20 April 2022

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm760

zbMATH Keywords

Boolean functionfaultlogic networksingle fault detection test

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items (1)

Shannon function of the test length with respect to gate input identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single fault detection tests for circuits of functional elements
• Circuits admitting single-fault tests of length 1 under constant faults at outputs of elements
• Method of synthesis of easily testable circuits admitting single fault detection tests of constant length
• Short Complete Fault Detection Tests for Logic Networks with Fan-In Two
• ON LOGIC NETWORKS ALLOWING SHORT SINGLE FAULT DETECTION TESTS UNDER ARBITRARY FAULTS OF GATES
• SINGLE FAULT DETECTION TESTS FOR LOGIC NETWORKS OF AND, NOT GATES
• Synthesis of easily testable logic networks under arbitrary stuck-at faults at inputs and outputs of gates
• A METHOD FOR CONSTRUCTING LOGIC NETWORKS ALLOWING SHORT SINGLE DIAGNOSTIC TESTS
• Easily Testable Realizations ror Logic Functions

This page was built for publication: Short single fault detection tests for logic networks under arbitrary faults of gates