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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., 2012, Volume 19, Number 1, Pages 33–40 (Mi da675)  

About the reliability of nonbranching programs in the basis of a generalized conjunction

S. M. Grabovskaya

Penza State University, Penza, Russia

Abstract: The problem of synthesis of nonbranching programs with conditional stop-operator is considered in a full finite basis which contains functions of the form $x_1\cdot x_2$, $\overline x_1\cdot x_2$ or $\overline x_1\cdot\overline x_2$. All functional operators are supposed to be prone to output inverse failures with probability $\varepsilon\in(0,1/2)$ and conditional stop-operators are absolutely reliable. Any Boolean function is proved to be realized by a nonbranching program with unreliability no more then $\varepsilon+59\varepsilon^2$ at $\varepsilon\in(0,1/960]$. Ill. 1, bibliogr. 4.

Keywords: Boolean function, nonbranching program, conditional stop-operator, synthesis, reliability.

Full text: PDF file (249 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.718
Received: 16.11.2010
Revised: 14.10.2011

Citation: S. M. Grabovskaya, “About the reliability of nonbranching programs in the basis of a generalized conjunction”, Diskretn. Anal. Issled. Oper., 19:1 (2012), 33–40

Citation in format AMSBIB
\Bibitem{Gra12}
\by S.~M.~Grabovskaya
\paper About the reliability of nonbranching programs in the basis of a~generalized conjunction
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 1
\pages 33--40
\mathnet{http://mi.mathnet.ru/da675}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2961450}


Linking options:
  • http://mi.mathnet.ru/eng/da675
  • http://mi.mathnet.ru/eng/da/v19/i1/p33

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:167
    Full text:50
    References:31
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020