About the reliability of nonbranching programs in the basis of a generalized conjunction

zbMATH Open1324.94070MaRDI QIDQ5263759FDOQ5263759

Authors: S. M. Grabovskaya 

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da675

Recommendations

• 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
• On the upper bound for unreliability of non-branching programs under constant faults of the same type on the outputs of computational operators
• 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 reliability of schemes in bases \(\{x\mid y\}\), \(\{x\downarrow y\}\) under constant input malfunctions of the same type

zbMATH Keywords

reliabilitysynthesisBoolean functionconditional stop-operatornonbranching program

Mathematics Subject Classification ID

Cited In (4)

• Reliability of nonbranching programs in an arbitrary complete finite basis
• 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
• 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: About the reliability of nonbranching programs in the basis of a generalized conjunction

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