Disjoint spread systems and fault location

Charles Colbourn, Bingli Fan, Daniel Horsley

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

When k factors each taking one of v levels may affect the correctness or performance of a complex system, a test is selected by setting each factor to one of its levels and determining whether the system functions as expected (passes the test) or not (fails). In our setting, each test failure can be attributed to at least one faulty (factor, level) pair. A nonadaptive test suite is a selection of such tests to be executed in parallel. One goal is to minimize the number of tests in a test suite from which we can determine which (factor, level) pairs are faulty, if any. In this paper, we determine the number of tests needed to locate faults when exactly one (or at most one) pair is faulty. To do this, we address an equivalent problem, to determine how many set partitions of a set of size N exist in which each partition contains v classes and no two classes in the partitions are equal.

Original languageEnglish (US)
Pages (from-to)2011-2026
Number of pages16
JournalSIAM Journal on Discrete Mathematics
Volume30
Issue number4
DOIs
StatePublished - 2016

Fingerprint

Disjoint
Fault
Partition
Set Partition
Complex Systems
Correctness
Minimise

Keywords

  • Baranyai's theorem
  • Covering array
  • Locating array
  • Sperner partition system

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Disjoint spread systems and fault location. / Colbourn, Charles; Fan, Bingli; Horsley, Daniel.

In: SIAM Journal on Discrete Mathematics, Vol. 30, No. 4, 2016, p. 2011-2026.

Research output: Contribution to journalArticle

Colbourn, Charles ; Fan, Bingli ; Horsley, Daniel. / Disjoint spread systems and fault location. In: SIAM Journal on Discrete Mathematics. 2016 ; Vol. 30, No. 4. pp. 2011-2026.
@article{d28233a56c1f40b385a5ff87ff2bc9a0,
title = "Disjoint spread systems and fault location",
abstract = "When k factors each taking one of v levels may affect the correctness or performance of a complex system, a test is selected by setting each factor to one of its levels and determining whether the system functions as expected (passes the test) or not (fails). In our setting, each test failure can be attributed to at least one faulty (factor, level) pair. A nonadaptive test suite is a selection of such tests to be executed in parallel. One goal is to minimize the number of tests in a test suite from which we can determine which (factor, level) pairs are faulty, if any. In this paper, we determine the number of tests needed to locate faults when exactly one (or at most one) pair is faulty. To do this, we address an equivalent problem, to determine how many set partitions of a set of size N exist in which each partition contains v classes and no two classes in the partitions are equal.",
keywords = "Baranyai's theorem, Covering array, Locating array, Sperner partition system",
author = "Charles Colbourn and Bingli Fan and Daniel Horsley",
year = "2016",
doi = "10.1137/16M1056390",
language = "English (US)",
volume = "30",
pages = "2011--2026",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

TY - JOUR

T1 - Disjoint spread systems and fault location

AU - Colbourn, Charles

AU - Fan, Bingli

AU - Horsley, Daniel

PY - 2016

Y1 - 2016

N2 - When k factors each taking one of v levels may affect the correctness or performance of a complex system, a test is selected by setting each factor to one of its levels and determining whether the system functions as expected (passes the test) or not (fails). In our setting, each test failure can be attributed to at least one faulty (factor, level) pair. A nonadaptive test suite is a selection of such tests to be executed in parallel. One goal is to minimize the number of tests in a test suite from which we can determine which (factor, level) pairs are faulty, if any. In this paper, we determine the number of tests needed to locate faults when exactly one (or at most one) pair is faulty. To do this, we address an equivalent problem, to determine how many set partitions of a set of size N exist in which each partition contains v classes and no two classes in the partitions are equal.

AB - When k factors each taking one of v levels may affect the correctness or performance of a complex system, a test is selected by setting each factor to one of its levels and determining whether the system functions as expected (passes the test) or not (fails). In our setting, each test failure can be attributed to at least one faulty (factor, level) pair. A nonadaptive test suite is a selection of such tests to be executed in parallel. One goal is to minimize the number of tests in a test suite from which we can determine which (factor, level) pairs are faulty, if any. In this paper, we determine the number of tests needed to locate faults when exactly one (or at most one) pair is faulty. To do this, we address an equivalent problem, to determine how many set partitions of a set of size N exist in which each partition contains v classes and no two classes in the partitions are equal.

KW - Baranyai's theorem

KW - Covering array

KW - Locating array

KW - Sperner partition system

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

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

U2 - 10.1137/16M1056390

DO - 10.1137/16M1056390

M3 - Article

VL - 30

SP - 2011

EP - 2026

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 4

ER -