scientific article
From MaRDI portal
Publication:3197775
zbMath0712.94027MaRDI QIDQ3197775
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fault detection; testing in circuits and networks (94C12) Logical aspects of Boolean algebras (03G05)
Related Items (18)
The length of a single fault detection test for constant-nonpreserving element insertions ⋮ Single diagnostic tests for inversion faults of gates in circuits over arbitrary bases ⋮ Estimations of the lengths of tests for logic gates in presence of many permissible faults ⋮ Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates ⋮ About the reliability of circuits in the complete finite basis containing an essential linear function ⋮ On the exact value of the length of the minimal single diagnostic test for a particular class of circuits ⋮ 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 ⋮ SINGLE FAULT DETECTION TESTS FOR LOGIC NETWORKS OF AND, NOT GATES ⋮ A generalization of Shannon function ⋮ Lower bounds for the lengths of single tests for Boolean circuits ⋮ A method of synthesis of irredundant circuits admitting single fault detection tests of constant length ⋮ Reliability of nonbranching programs in an arbitrary complete finite basis ⋮ About reliability of circuits with faults of type 0 at the outputs of elements in a full finite basis containing a special function ⋮ The generalized complexity of linear Boolean functions ⋮ Short Complete Fault Detection Tests for Logic Networks with Fan-In Two ⋮ Short single tests for circuits with arbitrary stuck-at faults at outputs of gates ⋮ The length of single fault detection tests with respect to substitution of gates with inverters ⋮ Synthesis of circuits admitting complete checking tests of constant length under inverse faults at outputs of elements
This page was built for publication:
