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, 2023, Number 62, Pages 71–82
DOI: https://doi.org/10.17223/20710410/62/6
(Mi pdm821)
 

Mathematical Backgrounds of Computer and Control System Reliability

Short fault detection tests for contact circuits under arbitrary weakly connected faults of contacts

K. A. Popkov

Keldysh Institute of Applied Mathematics, Moscow, Russia
References:
Abstract: We prove that for any natural $k$, any Boolean function can be implemented by a two-pole contact circuit that is $k$-irredundant and allows a $k$-fault detection test of length no more than $3$ relative to arbitrary connected faults of contacts in groups, where each group consists of one closing and one opening contact. We establish that if the Boolean function is not self-dual, then this bound can be lowered to $2$.
Keywords: contact circuit, connected faults of contacts, fault detection test, Boolean function.
Document Type: Article
UDC: 519.718.7
Language: Russian
Citation: K. A. Popkov, “Short fault detection tests for contact circuits under arbitrary weakly connected faults of contacts”, Prikl. Diskr. Mat., 2023, no. 62, 71–82
Citation in format AMSBIB
\Bibitem{Pop23}
\by K.~A.~Popkov
\paper Short fault detection tests for contact circuits under arbitrary weakly connected faults of contacts
\jour Prikl. Diskr. Mat.
\yr 2023
\issue 62
\pages 71--82
\mathnet{http://mi.mathnet.ru/pdm821}
\crossref{https://doi.org/10.17223/20710410/62/6}
Linking options:
  • https://www.mathnet.ru/eng/pdm821
  • https://www.mathnet.ru/eng/pdm/y2023/i4/p71
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:47
    Full-text PDF :23
    References:6
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024