Reliability of nonbranching programs in an arbitrary complete finite basis

DOI10.3103/S1066369X12020028MaRDI QIDQ1759235zbMATH OpenFDO

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

Publication date 20 November 2012

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

reliabilitysynthesisBoolean functionsconditional stop operatornonbranching programs

Mathematics Subject Classification ID

Recommendations

• About the reliability of nonbranching programs in the basis of a generalized conjunction
• On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction
• 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
• On the upper bound for unreliability of non-branching programs under constant faults of the same type on the outputs of computational operators
• About the reliability of circuits under failures of type 0 at the outputs of elements in a complete finite basis containing some pairs of functions

Cites work

• scientific article; zbMATH DE number 4172919 (Why is no real title available?)
• scientific article; zbMATH DE number 1037955 (Why is no real title available?)
• On the circuits reliability in bases of functions of no more than three variables

Cited in

(7)

• Upper bound of the circuits unreliability in a complete finite basis (in \(P_3\)) with arbitrary faults of elements
• About the reliability of nonbranching programs in the basis of a generalized conjunction
• Asymptotically optimal in reliability circuits in two bases under failures of 0 (k-1) type at the outputs of elements
• 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
• Upper estimate of unreliability of schemes in full finite basis (in \(P_2\)) for arbitrary faults of gates
• 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

This page was built for publication: Reliability of nonbranching programs in an arbitrary complete finite basis

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