Locating and detecting arrays for interaction faults

Charles Colbourn, Daniel W. McClary

Research output: Contribution to journalArticle

55 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)17-48
Number of pages32
JournalJournal of Combinatorial Optimization
Volume15
Issue number1
DOIs
StatePublished - Jan 2008

Fingerprint

Fault
Electric fault location
Testing
Interaction
Screening
Covering Array
Component-based Systems
Experiments
Group Testing
Location Problem
Combinatorial Problems
Restriction
Necessary Conditions
Scenarios

Keywords

  • Cover-free family
  • Covering array
  • Defecting array
  • Disjunct matrix
  • Factorial design
  • Locating array
  • Orthogonal array

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Mathematics(all)
  • Control and Optimization
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Locating and detecting arrays for interaction faults. / Colbourn, Charles; McClary, Daniel W.

In: Journal of Combinatorial Optimization, Vol. 15, No. 1, 01.2008, p. 17-48.

Research output: Contribution to journalArticle

@article{5f11e443b06b40a2942d14ad87d4c5ef,
title = "Locating and detecting arrays for interaction faults",
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 = "Cover-free family, Covering array, Defecting array, Disjunct matrix, Factorial design, Locating array, Orthogonal array",
author = "Charles Colbourn and McClary, {Daniel W.}",
year = "2008",
month = "1",
doi = "10.1007/s10878-007-9082-4",
language = "English (US)",
volume = "15",
pages = "17--48",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Locating and detecting arrays for interaction faults

AU - Colbourn, Charles

AU - McClary, Daniel W.

PY - 2008/1

Y1 - 2008/1

N2 - 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.

AB - 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.

KW - Cover-free family

KW - Covering array

KW - Defecting array

KW - Disjunct matrix

KW - Factorial design

KW - Locating array

KW - Orthogonal array

UR - http://www.scopus.com/inward/record.url?scp=37249058837&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37249058837&partnerID=8YFLogxK

U2 - 10.1007/s10878-007-9082-4

DO - 10.1007/s10878-007-9082-4

M3 - Article

AN - SCOPUS:37249058837

VL - 15

SP - 17

EP - 48

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 1

ER -