Advertisement

Lobachevskii Journal of Mathematics

, Volume 39, Issue 9, pp 1332–1342 | Cite as

An Upper Bound of Unreliability of Non-Branching Programs in an Arbitrary Complete Finite Basis for One-Type Constant Faults at the Outputs of Computational Operators

  • S. M. GrabovskayaEmail author
  • M. A. Alekhina
Part 2. Special issue “Actual Problems of Algebra and Analysis” Editors: A. M. Elizarov and E. K. Lipachev
  • 3 Downloads

Abstract

The implementation of Boolean functions by non-branching programs with a conditional stop operator is considered in an arbitrary complete finite basis. We assume that conditional stop operators of the program are absolutely reliable while all computational operators are prone to the output one-type constant faults of either type 0 or type 1. An upper bound for unreliability of the programs was found in different bases. It was proved that in some cases any Boolean function can be implemented by the non-branching program of arbitrarily high preassigned reliability.

Keywords and phrases

circuit non-branching program with conditional stop operators output one-type constant faults unreliability Boolean function 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Chashkin, “On the average time for the computation of the values of Boolean functions,” Diskr. Anal. Issled. Oper., Ser. 1 4 (1), 60–78 (1997).MathSciNetzbMATHGoogle Scholar
  2. 2.
    A. V. Chashkin, “On the mean time for computing Boolean operators,” Diskr. Anal. Issled. Oper., Ser. 1 5, 88–103 (1998).MathSciNetzbMATHGoogle Scholar
  3. 3.
    J. von Neuman, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” in Automata Studies (AM-34), Ed. by C. Shannon and J. McCarthy (Princeton Univ. Press, Princeton, 1956), pp. 34–98.Google Scholar
  4. 4.
    S. I. Ortyukov, “On redundancy of Boolean function realization with circuits of unreliable elements,” in Proceedings of Discrete Mathematics and its Applications Seminar (Moscow, 1987), pp. 166–168 [in Russian].Google Scholar
  5. 5.
    D. Uhlig, “Reliable networks from unreliable gates with almost minimal complexity,” Lect. Notes Comput. Sci. 278, 462–469 (1987).CrossRefGoogle Scholar
  6. 6.
    S. V. Yablonskiy, “Asymptotically the best method of synthesis of reliable circuits from unreliable elements,” Banach Center 7, 11–19 (1982).MathSciNetCrossRefGoogle Scholar
  7. 7.
    M. A. Alekhina, “Synthesis, reliability and complexity of circuits from unreliable functional elements,” Doctoral (Phys. Math.) Dissertation (Penz. State Univ., Penza, 2004).Google Scholar
  8. 8.
    V. V. Chugunova, “Synthesis of asymptotically optimal reliable circuits under inverse failures at the element outputs,” Cand. Sci. (Phys. Math.) Dissertation (Penz. State Univ., Penza, 2007).Google Scholar
  9. 9.
    A. V. Vasin, “Asymptotically optimal circuits on reliability in complete final basis of three-input gates,” Cand. Sci. (Phys. Math.) Dissertation (Penz. State Univ., Penza, 2010).Google Scholar
  10. 10.
    O. Y. Barsukova, “The synthesis of reliable circuits which realizes binary and ternary logics functions,” Cand. Sci. (Phys. Math.) Dissertation (Penz. State Univ., Penza, 2014).Google Scholar
  11. 11.
    S. M. Grabovskaya, “Asymptotically optimal reliable non-branching programs,” Cand. Sci. (Phys. Math.) Dissertation (Penz. State Univ., Penza, 2012).Google Scholar
  12. 12.
    M. A. Alekhina and S. M. Grabovskaya, “Reliability of nonbranching programs in an arbitrary complete finite basis,” Russ. Math. 56 (2), 10–18 (2012).MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    M. A. Alekhina, “On reliability of circuits over an arbitrary complete finite basis under single-type constant faults at outputs of elements,” DiscreteMath. Appl. 22, 383–391 (2012).MathSciNetzbMATHGoogle Scholar
  14. 14.
    S. M. Grabovskaya, “On methods of raise the reliability of non-branching programs with a conditional stop operator,” in Proceeding of the International Conference on Problems of Automation and Control in Technical Systems, Dedicated to the 70th Anniversary of the Victory in the Great PatrioticWar (Penza, Russia, 2015), pp. 339–342 [in Russian].Google Scholar
  15. 15.
    N. P. Red’kin, “On complete checking tests for circuits of functional elements,” inMathematical Problems of Cybernetics (Nauka, Moscow, 1989), Vol. 2, pp. 198–222 [in Russian].Google Scholar
  16. 16.
    S. V. Yablonskii, Introduction into DiscreteMathematics (Nauka, Moscow, 2001) [in Russian].Google Scholar
  17. 17.
    S. M. Grabovskaya, “On reliability of non-branching programs in bases containing generalized disjunction,” in Proceeding of the 19th International Scientific and Methodological Conference on University Education (MKUO-2015), Dedicated to the 70th Anniversary of the Victory in the Great PatrioticWar (Penza, Russia, 2015), pp. 218–219 [in Russian].Google Scholar
  18. 18.
    S. M. Grabovskaya, “On reliability of non-branching programs in bases containing generalized konjunction,” in Proceeding of the International Conference on Problems of Automation and Control in Technical Systems, Dedicated to the 70th Anniversary of the Victory in the Great Patriotic War (Penza, Russia, 2015), pp. 342–345 [in Russian].Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Penza State UniversityPenzaRussia
  2. 2.Penza State Technological UniversityPenzaRussia

Personalised recommendations