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

DOI10.1134/S199508021809024XzbMATH Open1430.94120OpenAlexW2908970140MaRDI QIDQ669532FDOQ669532

Authors: S. M. Grabovskaya, M. A. Alekhina 

Publication date: 15 March 2019

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199508021809024x

Recommendations

• On the upper bound for unreliability of non-branching programs under constant faults of the same type on the outputs of computational operators
• Reliability of nonbranching programs in an arbitrary complete finite basis
• On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction
• About the reliability of nonbranching programs in the basis of a generalized conjunction
• Upper estimate of unreliability of schemes in full finite basis (in \(P_2\)) for arbitrary faults of gates

zbMATH Keywords

Boolean functioncircuitnon-branching program with conditional stop operatorsoutput one-type constant faultsunreliability

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Analytic circuit theory (94C05) Fault detection; testing in circuits and networks (94C12)

Cites Work

• On reliability of circuits over an arbitrary complete finite basis under single-type constant faults at outputs of elements
• Title not available (Why is that?)
• Reliability of nonbranching programs in an arbitrary complete finite basis
• Title not available (Why is that?)
• Average time of computing Boolean operators
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Reliability of nonbranching programs in an arbitrary complete finite basis
• About the reliability of nonbranching programs in the basis of a generalized conjunction
• On the upper bound for unreliability of non-branching programs under constant faults of the same type on the outputs of computational operators
• On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction

This page was built for publication: 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669532)