Authors: Ce Shi Yu Tang JianXing Yin
Publish Date: 2011/10/20
Volume: 55, Issue: 1, Pages: 197-206
Abstract
Locating arrays are of interest in generating software test suites to cover all tway component interactions and locate interaction faults in componentbased systems Recently Tang Colbourn and Yin made an investigation into optimal locating arrays in the case where a single fault is to be located They pointed out that when two or more faults were considered matters would become rather complicated To handle those cases generally seems challenging but is well worth further research In this paper we establish a lower bound on the size of locating arrays with at most two faults and then prove that optimal locating arrays meeting this bound can be equivalently characterized in terms of orthogonal arrays with prescribed properties Using this characterization we develop a number of constructions of optimal locating arrays Two infinite series of optimal locating arrays are then obtained
Keywords: