Disjoint spread systems and fault location

DOI10.1137/16M1056390MaRDI QIDQ2830441zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Daniel Horsley, Bingli Fan

Publication date 28 October 2016

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.01318

zbMATH Keywords

covering arrayBaranyai's theoremlocating arraySperner partition system

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Searching and sorting (68P10) Partitions of sets (05A18) Other designs, configurations (05B30) Extremal combinatorics (05D99)

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.

Recommendations

• On the disturbed fault detection and isolation problem
• Distributed fault detection and isolation of continuous-time non-linear systems
• On the Diagnosis of System Faults with Propagation
• Construction of a fault location algorithm
• Fault Distinguishability of Discrete Event Systems
• Fault detection for discrete spatially interconnected systems with time-delay over finite frequency domains
• Double fault distinguishability in linear systems
• Distributed Fault Diagnosis in Discrete Event Systems via Set Intersection Refinements
• scientific article; zbMATH DE number 2016060

Cites work

• scientific article; zbMATH DE number 3161569 (Why is no real title available?)
• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• scientific article; zbMATH DE number 3654171 (Why is no real title available?)
• scientific article; zbMATH DE number 3683587 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 3570501 (Why is no real title available?)
• scientific article; zbMATH DE number 3625390 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• scientific article; zbMATH DE number 3228255 (Why is no real title available?)
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• A Sperner-type theorem for set-partition systems
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• A survey of combinatorial testing
• An Inequality on Binomial Coefficients
• Detachments of hypergraphs I: The Berge-Johnson problem
• Families of \(k\)-independent sets
• Locating and detecting arrays for interaction faults
• Locating errors using ELAs, covering arrays, and adaptive testing algorithms
• Locating one pairwise interaction: three recursive constructions
• Minimum average-case queries of q+1-ary search game with small sets
• On separating systems of a finite set
• On the Edge-Coloring Property for the Closure of the Complete Hypergraphs
• On the edge-colouring problem for unions of complete uniform hypergraphs
• Optimal locating arrays for at most two faults
• Optimality and constructions of locating arrays
• Products of mixed covering arrays of strength two
• Software and hardware testing using combinatorial covering suites
• Sperner capacities
• Sperner partition systems
• The edge-coloring of complete hypergraphs. I
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(8)

• New bounds on the maximum size of Sperner partition systems
• More constructions for Sperner partition systems
• On almost-regular edge colourings of hypergraphs
• Extremal Uniquely Resolvable Multisets
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Localization of multiple faults with group control on a discrete device
• On a combinatorial framework for fault characterization

This page was built for publication: Disjoint spread systems and fault location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830441)