Locating and detecting arrays for interaction faults |
| |
Authors: | Charles J Colbourn Daniel W McClary |
| |
Institution: | (1) Computer Science and Engineering, Arizona State University, PO Box 878809, Tempe, AZ 85287-8809, USA |
| |
Abstract: | The identification of interaction faults in component-based systems has focused on indicating the presence of faults, rather
than their location and magnitude. While this is a valuable step in screening a system for interaction faults prior to its
release, it provides little information to assist in the correction of such faults. Consequently tests to reveal the location
of interaction faults are of interest. The problem of nonadaptive location of interaction faults is formalized under the hypothesis
that the system contains (at most) some number d of faults, each involving (at most) some number t of interacting factors. Restrictions on the number and size of the putative faults lead to numerous variants of the basic
problem. The relationships between this class of problems and interaction testing using covering arrays to indicate the presence
of faults, designed experiments to measure and model faults, and combinatorial group testing to locate faults in a more general
testing scenario, are all examined. While each has some definite similarities with the fault location problems for component-based
systems, each has some striking differences as well. In this paper, we formulate the combinatorial problems for locating and
detecting arrays to undertake interaction fault location. Necessary conditions for existence are established, and using a
close connection to covering arrays, asymptotic bounds on the size of minimal locating and detecting arrays are established. |
| |
Keywords: | Covering array Orthogonal array Factorial design Cover-free family Disjunct matrix Locating array Defecting array |
本文献已被 SpringerLink 等数据库收录! |
|