On the upper bound for unreliability of non-branching programs under constant faults of the same type on the outputs of computational operators
From MaRDI portal
Publication:5264724
zbMATH Open1324.68022MaRDI QIDQ5264724FDOQ5264724
Authors: S. M. Grabovskaya 
Publication date: 27 July 2015
Full work available at URL: http://mathnet.ru/eng/da758
Recommendations
- 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
- 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 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
reliabilitysynthesisBoolean functionnon-branching programconditional stop-operatorone-type constant faults
Cited In (5)
- 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 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 termination and invariance for faulty channel machines
This page was built for publication: On the upper bound for unreliability of non-branching programs under constant faults of the same type on the outputs of computational operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264724)
