Prikladnaya Diskretnaya Matematika. Supplement
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



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






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


Prikladnaya Diskretnaya Matematika. Supplement, 2016, Issue 9, Pages 98–100
DOI: https://doi.org/10.17223/2226308X/9/38
(Mi pdma257)
 

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

Mathematical Foundations of Reliability of Computing and Control Systems

The unreliability of circuits in case coalescences of elements inputs

M. A. Alekhina, O. A. Logvina

Penza State Technological University, Penza
Full-text PDF (508 kB) Citations (2)
References:
Abstract: We consider the implementation of Boolean functions by circuits of unreliable functional elements in some complete finite bases. It is assumed that each of the circuit elements is exposed to disjunctive (conjunctive) coalescence of inputs independently of the other elements. It is shown that in some bases any Boolean function can be implemented by a circuit with any high reliability, and in some ones it can be done by a circuit with the unreliability, which is equal to zero.
Keywords: unreliable functional elements, circuit reliability, circuit unreliability, coalescences of elements inputs.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00273
Document Type: Article
UDC: 519.718
Language: Russian
Citation: M. A. Alekhina, O. A. Logvina, “The unreliability of circuits in case coalescences of elements inputs”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 98–100
Citation in format AMSBIB
\Bibitem{AleLog16}
\by M.~A.~Alekhina, O.~A.~Logvina
\paper The unreliability of circuits in case coalescences of elements inputs
\jour Prikl. Diskr. Mat. Suppl.
\yr 2016
\issue 9
\pages 98--100
\mathnet{http://mi.mathnet.ru/pdma257}
\crossref{https://doi.org/10.17223/2226308X/9/38}
Linking options:
  • https://www.mathnet.ru/eng/pdma257
  • https://www.mathnet.ru/eng/pdma/y2016/i9/p98
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:160
    Full-text PDF :32
    References:37
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024