RUS  ENG
Full version
JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2019 Number 4, Pages 54–57 (Mi vmumm643)

This article is cited in 1 paper

Short notes

Minimal complete fault detection tests for circuits of functional elements in the standard basis

K. A. Popkov

Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Moscow

Abstract: For each Boolean function we find 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.

Key words: logic network, one-type stuck-at fault, complete fault detection test.

UDC: 519.718.7

Received: 03.08.2018



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024