Loading [MathJax]/jax/output/SVG/config.js
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2019, Number 2, Pages 35–37 (Mi vmumm611)  
This article is cited in 6 scientific papers (total in 6 papers)

Short notes

Diagnostic tests for contact circuits

N. P. Red'kin

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (100 kB) Citations (6)
References:
PDF
HTML
Abstract: The full diagnostic test for contact circuits in the presence of one-type contact faults (breaking or closure) is considered. It is established constructively that any Boolean function can be realized by a contact circuit permitting a non-trivial full diagnostic test, i.e. test containing not all input vectors.
Key words: Boolean function, contact network, breaking and closure of contacts, diagnostic test for network.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00337
Received: 08.06.2017
English version:
Moscow University Mathematics Bulletin, 2019, Volume 74, Issue 2, Pages 62–64
DOI: https://doi.org/10.3103/S0027132219020049
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: N. P. Red'kin, “Diagnostic tests for contact circuits”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2019, no. 2, 35–37; Moscow University Mathematics Bulletin, 74:2 (2019), 62–64
Citation in format AMSBIB
\Bibitem{Red19}
\by N.~P.~Red'kin
\paper Diagnostic tests for contact circuits
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2019
\issue 2
\pages 35--37
\mathnet{http://mi.mathnet.ru/vmumm611}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3951993}
\zmath{https://zbmath.org/?q=an:1419.94096}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2019
\vol 74
\issue 2
\pages 62--64
\crossref{https://doi.org/10.3103/S0027132219020049}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000466898100004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85065244048}
Linking options:
  • https://www.mathnet.ru/eng/vmumm611
  • https://www.mathnet.ru/eng/vmumm/y2019/i2/p35
    • This publication is cited in the following 6 articles:
    1. K. A. Popkov, “Korotkie proveryayuschie testy razmykaniya dlya kontaktnykh skhem s dopolnitelnym polyusom”, Diskret. matem., 36:4 (2024), 117–137  mathnet  crossref
    2. K. A. Popkov, “Korotkie testy dlya kontaktnykh skhem pri odnotipnykh slabo svyaznykh neispravnostyakh kontaktov”, Diskret. matem., 35:4 (2023), 69–78  mathnet  crossref
    3. K. A. Popkov, “Korotkie proveryayuschie testy dlya kontaktnykh skhem pri proizvolnykh slabo svyaznykh neispravnostyakh kontaktov”, PDM, 2023, no. 62, 71–82  mathnet  crossref
    4. Monther Busbait, Mikhail Moshkov, Albina Moshkova, Vladimir Shevtchenko, Studies in Systems, Decision and Control, 493, Decision Trees for Fault Diagnosis in Circuits and Switching Networks, 2023, 1  crossref
    5. K. A. Popkov, “Short Tests of Closures for Contact Circuits”, Math. Notes, 107:4 (2020), 653–662  mathnet  crossref  crossref  mathscinet  isi  elib
    6. K. A. Popkov, “O polnykh diagnosticheskikh testakh dlya kontaktnykh skhem pri obryvakh i/ili zamykaniyakh kontaktov”, Izvestiya vysshikh uchebnykh zavedenii. Povolzhskii region. Fiziko-matematicheskie nauki, 2019, no. 3, 5–24  mathnet  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:202
    Full-text PDF :31
    References:41
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025