On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction

DOI10.17223/20710410/43/5MaRDI QIDQ5151256zbMATH OpenOpenAlexFDO

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

Publication date 17 February 2021

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

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

zbMATH Keywords

reliabilitysynthesisBoolean functionconditional stop operatornon-branching program

Mathematics Subject Classification ID

Data structures (68P05) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Fault detection; testing in circuits and networks (94C12) Boolean functions (06E30)

Recommendations

• Reliability of nonbranching programs in an arbitrary complete finite basis
• About the reliability of nonbranching programs in the basis of a 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
• Sufficient conditions for implementation of Boolean functions by asymptotically optimal on reliability circuits with the trivial estimate of unreliability in the case of faults of type 0 at the element outputs

Cites work

• scientific article; zbMATH DE number 5906481 (Why is no real title available?)
• scientific article; zbMATH DE number 1037955 (Why is no real title available?)
• On bases with unreliability coefficient 2
• On reliability of circuits over an arbitrary complete finite basis under single-type constant faults at outputs of elements
• On the circuits reliability in ``anticonjunction basis with constant faults at gate inputs
• Reliability of nonbranching programs in an arbitrary complete finite basis
• Synthesis of reliable schemes of functional elements \(x/y\) in the case of constant faults of the same type on outputs of elements
• Upper estimate of unreliability of schemes in full finite basis (in \(P_2\)) for arbitrary faults of gates

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
• 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: On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction

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