On the exact value of the length of the minimal single diagnostic test for a particular class of circuits
From MaRDI portal
Publication:5374004
DOI10.1134/S1990478917030140zbMath1399.93061OpenAlexW2752332371MaRDI QIDQ5374004
Publication date: 6 April 2018
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478917030140
Related Items (6)
Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates ⋮ A METHOD FOR CONSTRUCTING LOGIC NETWORKS ALLOWING SHORT SINGLE DIAGNOSTIC TESTS ⋮ Lower bounds for the lengths of single tests for Boolean circuits ⋮ A method of synthesis of irredundant circuits admitting single fault detection tests of constant length ⋮ Short single tests for circuits with arbitrary stuck-at faults at outputs of gates ⋮ Lower bound of the length of a single fault diagnostic test with respect to insertions of a mod-2 adder
Cites Work
- Testable design of AND-EXOR logic networks with universal test sets
- Synthesis of easily-tested circuits in the case of single-type constant malfunctions at the element outputs
- 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
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- Dual-Mode Logic for Function-Independent Fault Testing
- On Minimally Testable Logic Networks
- On the synthesis of circuits admitting complete fault detection test sets of constant length under arbitrary constant faults at the outputs of the gates
- Easily Testable Realizations ror Logic Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the exact value of the length of the minimal single diagnostic test for a particular class of circuits