ON THE ARBITRARILY RELIABLE IMPLEMENTATION OF BOOLEAN FUNCTIONS BY NON-BRANCHING PROGRAMS WITH A CONDITIONAL STOP OPERATOR IN BASES WITH GENERALIZED CONJUNCTION
From MaRDI portal
Publication:5151256
DOI10.17223/20710410/43/5zbMath1458.68046OpenAlexW2936871612MaRDI QIDQ5151256
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
Fault detection; testing in circuits and networks (94C12) Boolean functions (06E30) Data structures (68P05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Cites Work
- On the circuits reliability in ``anticonjunction basis with constant faults at gate inputs
- Upper estimate of unreliability of schemes in full finite basis (in \(P_2\)) for arbitrary faults of gates
- Reliability of nonbranching programs in an arbitrary complete finite basis
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item