Preprints of the Keldysh Institute of Applied Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Keldysh Institute preprints:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Preprints of the Keldysh Institute of Applied Mathematics, 2018, 161, 7 pp.
DOI: https://doi.org/10.20948/prepr-2018-161
(Mi ipmp2520)
 

Minimal complete fault detection tests for logic networks in the standard basis

K. A. Popkov
References:
Abstract: For each Boolean function, we find the exact value of 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.
Keywords: logic network, one-type stuck-at fault, complete fault detection test.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00337_а
Bibliographic databases:
Document Type: Preprint
Language: Russian
Citation: K. A. Popkov, “Minimal complete fault detection tests for logic networks in the standard basis”, Keldysh Institute preprints, 2018, 161, 7 pp.
Citation in format AMSBIB
\Bibitem{Pop18}
\by K.~A.~Popkov
\paper Minimal complete fault detection tests for logic networks in the standard basis
\jour Keldysh Institute preprints
\yr 2018
\papernumber 161
\totalpages 7
\mathnet{http://mi.mathnet.ru/ipmp2520}
\crossref{https://doi.org/10.20948/prepr-2018-161}
\elib{https://elibrary.ru/item.asp?id=35421321}
Linking options:
  • https://www.mathnet.ru/eng/ipmp2520
  • https://www.mathnet.ru/eng/ipmp/y2018/p161
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Препринты Института прикладной математики им. М. В. Келдыша РАН
    Statistics & downloads:
    Abstract page:107
    Full-text PDF :38
    References:23
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024