On upper bound of non-branching programs unreliability at one-type constant faults on the computational operators outputs

The realization of Boolean functions by non-branching programs with a conditional stop is considered in an arbitrary complete finite basis. It is supposed that conditional stop-operators are absolutely reliable and all computational operators are prone to one type constant faults at the outputs independently of each other with probability $\varepsilon\in(0,1/2)$. For the basis, the upper bound $\varepsilon+4\varepsilon^2$ is obtained for unreliability of non-branching programs realizing any Boolean function for all $\varepsilon\in(0,1/960]$. Ill. 4, bibliogr. 6.