Abstract
Locating arrays are of interest in generating software test suites to cover all t-way component interactions and locate interaction faults in component-based 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
