On single fault detection tests for formulas over certain bases with respect to stuck-at faults at gate outputs
Received: 23 Oct 2026 Accepted: 24 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 232–235
Abstract
The cardinality of a single fault detection test set with respect to stuck-at faults at gate outputs is studied for Boolean formulas. An asymptotic upper bound for the corresponding Shannon function is established for three bases close to the standard one. For the “Peirce arrow” and “Sheffer stroke” bases, a growing lower bound for this function is obtained, as well as an upper bound (expressed in terms of the formula’s rank) on minimal test set cardinality. Not every Boolean function admits an irredundant formula over the latter two bases.
Keywords: fault detection test set, stuck-at faults, Boolean formula.
BibTeX
@article{IS-Cui-Romanov2026,
author = {Cui, Zhenyu and Romanov, Dmitrii Sergeevich},
title = {{On single fault detection tests for formulas over certain bases with respect to stuck-at faults at gate outputs}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {232--235},
}
AMSBIB
\Bibitem{IS-Cui-Romanov2026}
\by Z.~Cui, D.\,S.~Romanov
\paper On single fault detection tests for formulas over certain bases with respect to stuck-at faults at gate outputs
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 232--235
\lang In Russian
RU