@article{article_259723, title={Locating one pairwise interaction: Three recursive constructions}, journal={Journal of Algebra Combinatorics Discrete Structures and Applications}, volume={3}, pages={127–134}, year={2016}, DOI={10.13069/jacodesmath.17551}, author={Colbourn, Charles J. and Fan, Bingli}, abstract={<p>In a complex component-based system, choices (levels) for components (factors) may interact to <br />cause faults in the system behaviour. When faults may be caused by interactions among few factors <br />at specific levels, covering arrays provide a combinatorial test suite for discovering the presence of <br />faults. While well studied, covering arrays do not enable one to determine the specific levels of factors <br />causing the faults; locating arrays ensure that the results from test suite execution suffice to determine <br />the precise levels and factors causing faults, when the number of such causes is small. Constructions <br />for locating arrays are at present limited to heuristic computational methods and quite specific direct <br />constructions. In this paper three recursive constructions are developed for locating arrays to locate <br />one pairwise interaction causing a fault. </p>}, number={3}, publisher={iPeak Academy}