Abstract
We consider problems of operability checking and state diagnosis of N functional elements realizing a given Boolean function f ∈ {x1 & ... &xn, x1 ∨ ... ∨ xn\(\overline {x_1 } \)} in their perfect states and including not more than k faulty elements by means of composition of one-output circuits from them and observation of values produced by these circuits on any value set of input variables. Arbitrary constant faults on outputs of functional elements are permitted. One has to minimize the number of circuits required for operability checking and determination the states of all elements. Lower bounds of the form ck(log2N − log2k) are obtained for the number of circuits.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
