The length of a single fault detection test for constant-nonpreserving element insertions

DOI10.1007/S10598-021-09510-5zbMath1460.94094OpenAlexW3127903713MaRDI QIDQ830998

N. E. Aleksandrova, Dmitry S. Romanov

Publication date: 10 May 2021

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-021-09510-5

zbMATH Keywords

detection testcombinational circuitsShannon function of test lengthelement insertion

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (1)

Lower bound of the length of a single fault diagnostic test with respect to insertions of a mod-2 adder

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower estimate of the length of the complete test in the basis \(\{x|y \}\)
• A method of synthesis of irredundant circuits admitting single fault detection tests of constant length
• Complexity of Boolean functions in the class of polarized polynomial forms
• Circuits admitting single-fault tests of length 1 under constant faults at outputs of elements
• Dual-Mode Logic for Function-Independent Fault Testing
• A Note on Easily Testable Realizations for Logic Functions
• Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates
• On Minimally Testable Logic Networks
• Short Complete Fault Detection Tests for Logic Networks with Fan-In Two
• 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

This page was built for publication: The length of a single fault detection test for constant-nonpreserving element insertions