Abstract
An algorithm is presented for designing minimum-expected-cost test trees for detecting and isolating single faults in a system. A test is specified by the subset of components that must be good for the test to pass, and with each test is associated a fixed cost. Each component is assumed to have an a priori probability of failure. The test tree specifies an adaptive testing procedure that detects a failure and isolates the faulty component while minimizing the expected cost of testing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.