Author:

Keywords:

Sequential testing, K-out-of-n systems, Imperfect tests, Sequencing and scheduling

Abstract:

A k-out-of-n system configuration requires that, for the overall system to be functional, at least k out of the total of n components be working. We consider the problem of sequentially testing the components of a k-out-of-n system in order to learn the state of the system, when the tests are costly and when the individual component tests are imperfect, which means that a test can identify a component as working when in reality it is down, and vice versa. Each component is tested at most once. Since tests are imperfect, even when all components are tested the state of the system is not necessarily known with certainty, and so reaching a lower bound on the probability of correctness of the system state is used as a stopping criterion for the inspection. We define different classes of inspection policies and we examine global optimality of each of the classes. We find that a globally optimal policy for diagnosing k-out-of-n systems with imperfect tests can be found in polynomial time when the predictive error probabilities are the same for all the components. Of the three policy classes studied, the dominant policies always contain a global optimum, while elementary policies are compact in representation. The newly introduced class of so-called `interrupted block-walking' policies combines these merits of global optimality and of compactness.