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
- 作者: Grabovskaya S.1, Alekhina M.2
-
隶属关系:
- Penza State University
- Penza State Technological University
- 期: 卷 39, 编号 9 (2018)
- 页面: 1332-1342
- 栏目: Part 2. Special issue “Actual Problems of Algebra and Analysis” Editors: A. M. Elizarov and E. K. Lipachev
- URL: https://journals.rcsi.science/1995-0802/article/view/203286
- DOI: https://doi.org/10.1134/S199508021809024X
- ID: 203286
如何引用文章
详细
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.
作者简介
S. Grabovskaya
Penza State University
编辑信件的主要联系方式.
Email: swetazin@mail.ru
俄罗斯联邦, ul. Krasnaya 40, Penza, 440026
M. Alekhina
Penza State Technological University
Email: swetazin@mail.ru
俄罗斯联邦, proezd Baidukova/ul. Gagarina 1a/11, Penza, 440039