Sequential testing of complex systems: A review

Discrete Applied Mathematics

Volumn 142, Issue 1-3 SPEC. ISS., 2004, Pages 189-205

  Ünlüyurt, Tonguç ^a  

^a SABANCI UNIVERSITY   (Turkey)

Author keywords

Boolean functions; Sequential testing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; RELIABILITY; VECTORS;

MULTI-COMPONENT SYSTEMS; SEQUENTIAL TESTING; WAFER PROBE TESTING;

LARGE SCALE SYSTEMS;

EID: 18544406518     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2002.08.001     Document Type: Article

References (67)

1. Alidaee B. Optimal ordering policy of a sequential model. J. Optim. Theory Appl. 83:1994;199-205.
2. Ben-Dov Y. A branch and bound algorithm for minimizing the expected cost of testing coherent systems. Eur. J. Oper. Res. 7:1981;284-289.
3. Ben-Dov Y. Optimal testing procedures for special structures of coherent systems. Manage. Sci. 27(12):1981;1410-1420.
4. Bioch J.C., Ibaraki T. Complexity of identification and dualization of positive Boolean functions. Inform. and Comput. 123:1995;51-75.
5. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, An incremental rnc algorithm for generating all maximal independent sets in hypergraphs of bounded dimension, DIMACS Research Report 2000-21, Rutgers University, DIMACS, 2000.
6. Boros E., Ünlüyurt T. Diagnosing double regular systems. Ann. Math. Artif. Intell. 26:1999;171-191.
7. E. Boros, T. Ünlüyurt, Sequential testing of series-parallel systems of small depth, in: Laguna, Velarde (Eds.), Kluwer, Boston, Computing Tools for the New Millennium, 2000, pp. 39-74.
8. Breitbart Y., Reiter A. A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions. Acta Inform. 4:1975;311-319.
9. Cascio F., Console L., Guagliumi M., Osella M., Panati A., Sottano D.T. Dupré S. Generating on-board diagnostics of dynamic automotive systems based on qualitative models. AI Comm. 12(1/2):1999;33-43.
10. Chang M., Shi W., Fuchs W.K. Optimal diagnosis procedures for k-out-of-n structures. IEEE Trans. Comput. 39(4):1990;559-564.
11. S.Y. Chiu, L.A. Cox Jr., X. Sun, Optimal sequential inspections of reliability systems subject to parallel chain precedence constraints, 1997 (personal communication).
12. Chung P., Wang Y., Hajj I.N. Logic design error diagnosis and correction. IEEE Trans. Very Large Scale Integration (VLSI) Systems. 2(3):1994;320-332.
13. Cox L.A. Jr. Incorporating statistical information into expert classification systems to reduce classification costs. Ann. Math. Artif. Intell. 2:1990;93-108.
14. Cox L.A., Chiu S.Y., Sun X. Least-cost failure diagnosis in uncertain reliability systems. Reliab. Engrg. System Safety. 54:1996;203-216.
15. Cox L.A. Jr., Qiu Y. Optimal inspection and repair of renewable coherent systems with independent components and constant failure rates. Naval Res. Logist. 41:1994;771-788.
16. Cox L.A. Jr., Qiu Y., Kuehner W. Heuristic least-cost computation of discrete classification functions with uncertain argument values. Ann. Oper. Res. 21:1989;1-21.
17. D. Dubois, M.P. Wellman, B. D'Ambrosio, P. Smets (Eds.), Guess-and-verify heuristics for reducing uncertainties in expert classification systems, uncertainty in artificial intelligence, Proceedings of the Eighth Conference, Morgan Kaufman, Los Altos, CA, 1992.
18. Duffuaa S.O., Raouf A. An optimal sequence in multicharacteristics inspection. J. Optim. Theory Appl. 67(1):1990;79-87.
19. Eiter T., Gottlob B. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6):1995;1278-1304.
20. Fredman M., Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms. 21(3):1996;618-628.
21. Friedrich G., Gottlob G., Nejdl W. Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques. (special issue on logic programming in intelligent decision and control systems) Comput. Math. Appl. 20(9/10):1990;57-72.
22. G. Friedrich, W. Nejdl, Generating efficient diagnostic decision tree procedures for model-based reasoning systems, in: International Workshop on Model-Based Diagnosis, Paris, July 1989.
23. Ganapathy S., Rajaraman V. Information theory applied to conversion of decision tables to computer programs. Comm. ACM. 16(9):1973;532-539.
24. Garey M.R. Optimal binary identification procedures. SIAM J. Appl. Math. 23(2):1972;173-186.
25. Garey M.R. Simple binary identification problems. IEEE Trans. Comput. 21:1972;588-590.
26. Garey M.R. Optimal task sequencing with precedence constraints. Discrete Math. 4:1973;37-56.
27. Garey M.R., Graham R.L. Performance bounds on the splitting algorithm for binary testing. Acta Inform. 3:1974;347-355.
28. D. Geiger, J.A. Barnett, Optimal satisficing tree searches, in: AAAI91, Anaheim, CA, Morgan Kaufmann, Los Altos, CA, 1991, pp. 441-445.
29. Greiner R. Finding optimal derivation strategies in redundant knowledge bases. Artificial Intelligence. 50:1990;95-115.
30. Gudes E., Hoffman A. A note on "an optimal evaluation of Boolean expressions in an online query system" Short Commun. Artif. Intell./Language Process. 22(10):1979;550-553.
31. Gurvich V., Khachiyan L. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Appl. Math. 96-97(1-3):1999;363-373.
32. Halpern J.Y. Evaluating Boolean function with random variables. Internat. J. Systems Sci. 5(6):1974;545-553.
33. Hanani M.Z. An optimal evaluation of Boolean expressions in an online query system. Short Commun. Artif. Intell./Language Process. 20(5):1977;344-347.
34. Huth M., Ryan M. Logic in Computer Science: Modelling and Reasoning about Systems. 1999;Cambridge University Press, Cambridge.
35. Hyafil L., Rivest R.L. Constructing optimal binary decision trees is NP-complete. Inform. Process. Lett. 5(1):1976;15-17.
36. Jedrzejowicz P. Minimizing the average cost of testing coherent systems. complexity and approximate algorithms IEEE Trans. Reliab. R-32(1):1983;66-70.
37. Joyce W.B. Organizations of unsuccessful R&D projects. IEEE Trans. Engrg. Manage. EM-18(2):1971;57-65.
38. Kadane J.B. Quiz show problems. J. Math. Anal. Appl. 27:1969;609-623.
39. Kleer J., Williams B.C. Diagnosing multiple faults. Artificial Intelligence. 32:1987;97-130.
40. R. Kowalski, Search strategies for theorem proving, in: B. Meltzer, D. Mitchie (Eds.), Machine Intelligence, Vol. 5, Edinburgh University Press, Edinburgh, 1969, pp. 181-201.
41. Lee H.L. On the optimality of a simplified multicharacteristic component inspection model. IIE Trans. 20(4):1988;392-398.
42. Makino K., Ibaraki T. The maximum latency and identification of positive Boolean functions. Du D.Z., Zhang X.S. ISAAC'94 Algorithms and Computation. Lecture Notes in Computer Science. Vol. 834:1994;324-332 Springer, Berlin, Heidelberg.
43. K.L. McMillan, Symbolic Model Checking, Kluwer, Dordrecht, 1993, ISBN 0-7923-9380-5.
44. L.G. Mitten, An analytic solution to the least cost testing sequence problem, J. Indust. Engrg. (January-February 1960) 17.
45. Miyakawa M. Optimum decision trees - an optimal variable theorem and its applications. Acta Inform. 22(5):1985;475-498.
46. Miyakawa M. Criteria for selecting a variable in the construction of efficient trees. IEEE Trans. Comput. 38(1):1989;130-141.
47. Monma C.L. Sequencing with general precedence constraints. Discrete Appl. Math. 3:1981;137-150.
48. Monma C.L., Sidney J.B. Sequencing with series-parallel precedence constraints. Math. Oper. Res. 4(3):1979;215-224.
49. Moret B.M.E. Decision trees and diagrams. Comput. Surveys. 14(4):1982;593-623.
50. Muroga S. Threshold Logic and Its Applications. 1971;Wiley, New York.
51. K.S. Natarajan, Optimizing depth-first search of AND-OR trees, Technical Report, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, 1986.
52. Nilsson N.J. Problem-solving Methods in Artificial Intelligence. 1971;McGraw-Hill, New York.
53. H.W. Price, Least-cost testing sequence, J. Indust. Engrg. July-August (1959) 278-279.
54. Qiu Y., Cox L.A. Jr. Heuristic testing procedures for general coherent systems. Eur. J. Oper. Res. 69:1993;65-74.
55. Raouf A., Jain J.K., Sathe P.T. A cost-minimization model for multicharacteristic component inspection. IIE Trans. 15(3):1983;187-194.
56. J.G. Rau, Minimizing a function of permutations of n integers, Technical Notes, 1969, pp. 237-240.
57. Reinwald L.T., Soland R.M. Conversion of limited-entry decision tables to optimal computer programs, i. minimum average processing time J. Assoc. Comput. Mach. 13(3):1966;339-358.
58. Reiter R. A theory of diagnosis from first principles. Artificial Intelligence. 32:1987;57-95.
59. Simon H.A., Kadane J.B. Optimal problem-solving search. all-or-none solutions Artificial Intelligence. 6:1975;235-247.
60. Smith D.E. Controlling backward inference. Artificial Intelligence. 39:1989;145-208.
61. X. Sun, S.Y. Chiu, L.A. Cox, A hill-climbing approach for optimizing classification trees (personal communication).
62. Wang J. Identifying key missing data for inference under uncertainty. Internat. J. Approx. Reason. 10:1994;287-309.
63. Wang J., Triantaphyllou E. A cost effective question-asking strategy for horn clause systems. Ann. Math. Artif. Intell. 17:1996;359-379.
64. Wang J., Vanda Vate J. Question asking strategies for horn clause systems. Ann. Math. Artif. Intell. 1:1990;359-370.
65. I. Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 2000.
66. R.O. Winder, Threshold logic, Ph.D. Dissertation, Department of Mathematics, Princeton University, 1962.
67. Yener A., Rose C. Highly mobile users and paging. optimal polling strategies IEEE Trans. Veh. Tech. 47(4):1998;1251-1257.