Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika, 2021, Number 51, Pages 85–100
DOI: https://doi.org/10.17223/20710410/51/4
(Mi pdm732)
 

This article is cited in 3 scientific papers (total in 3 papers)

Mathematical Backgrounds of Computer and Control System Reliability

On logic networks allowing short single fault detection tests under arbitrary faults of gates

K. A. Popkov

Keldysh Institute of Applied Mathematics, Moscow, Russia
Full-text PDF (736 kB) Citations (3)
References:
Abstract: It is proved that one can implement any non-constant Boolean function in $n$ variables by an irredundant logic network in the basis $\{\&,\oplus,\neg\}$, containing not more than one dummy input variable and allowing a single fault detection test with length not more than $2n+3$ regarding arbitrary faults of logic gates.
Keywords: logic network, Boolean function, fault, single fault detection test.
Funding agency Grant number
Russian Science Foundation 19-71-30004
Bibliographic databases:
Document Type: Article
UDC: 519.718.7
Language: Russian
Citation: K. A. Popkov, “On logic networks allowing short single fault detection tests under arbitrary faults of gates”, Prikl. Diskr. Mat., 2021, no. 51, 85–100
Citation in format AMSBIB
\Bibitem{Pop21}
\by K.~A.~Popkov
\paper On logic networks allowing short single fault detection tests under arbitrary faults of gates
\jour Prikl. Diskr. Mat.
\yr 2021
\issue 51
\pages 85--100
\mathnet{http://mi.mathnet.ru/pdm732}
\crossref{https://doi.org/10.17223/20710410/51/4}
Linking options:
  • https://www.mathnet.ru/eng/pdm732
  • https://www.mathnet.ru/eng/pdm/y2021/i1/p85
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:116
    Full-text PDF :76
    References:22
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024