Abstract
for each Boolean function we calculate the exact value of the minimal possible length of a complete fault detection test for logic networks implementing this function in the basis “conjunction, disjunction, negation” under one-type stuck-at faults at outputs of gates.
References
S. V. Yablonskii, “Reliability and Monitoring of Control Systems,” in: Proc. All Union Workshop in Discrete Mathematics and its Applications (January 31–February 2, 1984, Moscow) (Moscow State Univ. Moscow, 1986), pp. 7–12.
S. V. Yablonskii, “Some Problems of Reliability and Monitoring of Control Circuits,” in: Mathematical Problems of Cybernetics, Issue 1 (Nauka, Moscow, 1988), pp. 5–25 [in Russian].
N. P. Red’kin, Reliability and Diagnostics of Circuits (Moscow State University, Moscow, 1992) [in Russian].
N. P. Red’kin, “Circuits Admitting Short Tests,” Vestn. Mosk. Univ., Matem. Mekhan., No. 2, 17 (1988).
Yu. V. Borodina, “Synthesis of Easily Tested Circuits in the Case of Single-Type Constant Faults at Outputs of Elements,” Vestn. Mosk. Univ., Vychisl. Matem. Kibern., No. 1, 40 (2008).
S. V. Yablonskii, Introduction to Discrete Mathematics (Nauka, Moscow, 1986) [in Russian].
Acknowledgments
The work was supported by the Russian Foundation for Basic Research (project no. 18-01-00337, “Problems of synthesis, complexity, and reliability in the theory of control systems”).
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © The Author(s). 2019. published in Vestnik Moskovskogo Universiteta. Matematika. Mekhanika. 2019. Vol. 74, No. 4, pp. 54–57.
About this article
Cite this article
Popkov, K.A. Minimal Complete Fault Detection Tests for Circuits of Functional Elements in Standard Basis. Moscow Univ. Math. Bull. 74, 171–173 (2019). https://doi.org/10.3103/S0027132219040077
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132219040077