Lower Bounds and Construction of Detecting Arrays
Journal of Combinatorial Designs · 2026-09 · 34 (9) · 415-436
DOI: 10.1002/jcd.70022 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 11.05.2026. Verfasst von Hao Wang und 2 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Combinatorial testing has been widely used to generate test suites for detecting faults in various systems. As a type of fractional factorial design, detecting arrays have been proposed, out of the practical need for locating faults. In previous studies, the optimum detecting arrays in some cases have been determined through direct constructions and algorithmic methods. However, there are no practical lower bounds on the size of optimum detecting arrays for the general case. In this paper, we present two connections between detecting arrays and Sperner set systems that enables us to obtain lower bounds. An improved tabu search algorithm is developed for constructing mixed‐level detecting arrays with a small number of rows. The performance of the algorithm is investigated by computational experiments. The experimental results show that the proposed algorithm can efficiently generate high‐quality detecting arrays for different problem instances. Based on the lower bounds and algorithms presented in this study, several new optimum detecting arrays are obtained.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Wang, H., Fan, B., & Qu, H. (2026). Lower Bounds and Construction of Detecting Arrays. Journal of Combinatorial Designs, 34(9), 415-436. https://doi.org/10.1002/jcd.70022
Vancouver
Wang H, Fan B, Qu H. Lower Bounds and Construction of Detecting Arrays. Journal of Combinatorial Designs. 2026;34(9):415-436. doi:10.1002/jcd.70022
BibTeX
@article{Wang2026,
author = {Wang, Hao and Fan, Bingli and Qu, Huiwen},
title = {Lower Bounds and Construction of Detecting Arrays},
journal = {Journal of Combinatorial Designs},
year = {2026},
volume = {34},
number = {9},
pages = {415--436},
doi = {10.1002/jcd.70022}
}
EUVIMED