Abstract
We consider the problem of testing sequentially the components of a multi-component system, when the testing of each component is costly. We propose a new testing policy, that can be executed in polynomial time in the input size, and show that it is cost-minimal in the average case sense, for certain double regular systems that include regular (in particular, threshold) systems with identical components. This result generalizes known results for series, parallel, and, more generally, for k-out-of-n systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Arseneau, Optimal testing strategies for s,t-series parallel systems, Master's thesis, Combinatorics and Optimization, University of Waterloo (1996).
Y. Ben-Dov, Optimal testing procedures for special structures of coherent systems, Manag. Sci., 27(12) (1981) 1410-1420.
E. Boros, P.L. Hammer, T. Ibaraki and K. Kawakami, Identifying 2-monotonic positive Boolean functions in polynomial time, in: ISA'91 Algorithms, Lecture Notes in Computer Science, Vol. 557, eds. W.L. Hsu and R.C.T. Lee, Springer, Berlin/Heidelberg, 1991, pp. 104-115.
E. Boros and T. Unluyurt, Testing series-parallel systems of small depth, RUTCOR Research Report RRR 99-6, Rutgers University, RUTCOR (1999).
Y. Breitbart and S. Gal, Analysis of algorithms for the evaluation of monotonic Boolean functions, IEEE Trans. Comput. 27(11) (1978) 1083-1087.
R. Butterworth, Some reliability fault testing models, Oper. Res. 20 (1972) 335-343.
C.L. Chang and J.R. Slagle, An admissible and optimal algorithm for searching and-or graphs, Artif. Intell. 2 (1971) 117-128.
M. Chang, W. Shi and W.K. Fuchs, Optimal diagnosis procedures for k-out-of-n structures, IEEE Trans. Comput. 39(4) (1990) 559-564.
D. Dubois, M.P. Wellman, B. D'Ambrosio and P. Smets, eds., Guess-And-Verify Heuristics for Reducing Uncertainties in Expert Classification Systems, Proceedings of the 8th Conference on Uncertainty in Artificial Inteligence (Morgan Kaufman, San Mateo, CA, 1992).
S.O. Duffuaa and A. Raouf, An optimal sequence in multicharacteristics inspection, J. Optim. Theory Appl. 67(1) (1990) 79-87.
M.R. Garey, Optimal task sequencing with precedence constraints, Discrete Math. 4 (1973) 37-56.
R. Greiner, Finding optimal derivation strategies in redundant knowledge bases, Artif. Intell. 50 (1990) 95-115.
L.A. Cox Jr., Y. Qiu and W. Kuehner, Heuristic least-cost computation of discrete classification functions with uncertain argument values, Ann. Oper. Res. 21 (1989) 1-21.
J.B. Kadane, Quiz show problems, J. Math. Anal. Appl. 27 (1969) 609-623.
R. Kowalski, Search strategies for theorem proving, in: Machine Intelligence, Vol. 5, eds. B. Meltzer and D. Mitchie, (Edinburgh University Press, Edinburgh, 1969) pp. 181-201.
R. Kowalski, And-or graphs, theorem proving graphs and bi-directional search, in: Machine Intelligence, Vol. 7, eds. B. Meltzer and D. Mitchie (Edinburgh University Press, Edinburgh, 1972) pp. 167-194.
C.L. Monma and J.B. Sidney, Sequencing with series-parallel precedence constraints, Technical Report, Cornell University (1976).
S. Muroga, Threshold Logic and Its Applications (Wiley, New York, 1971).
N.J. Nilsson, Problem-Solving Methods in Artificial Intelligence (McGraw-Hill, New York, 1971).
I. Pohl, Bi-directional search, in: Machine Intelligence, Vol. 6, eds. B. Meltzer and D. Mitchie (Edinburgh University Press, Edinburgh, 1971) pp. 127-140.
H.A. Simon and J.B. Kadane, Optimal problem-solving search: All-or-none solutions, Artif. Intell. 6 (1975) 235-247.
R.O. Winder, Threshold logic, Ph.D. dissertation, Princeton University, Department of Mathematics (1962).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boros, E., Ünlüyurt, T. Diagnosing double regular systems. Annals of Mathematics and Artificial Intelligence 26, 171–191 (1999). https://doi.org/10.1023/A:1018958928835
Issue Date:
DOI: https://doi.org/10.1023/A:1018958928835