Optimality and constructions of locating arrays

Yu Tang, Charles Colbourn, Jianxing Yin

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


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. However, constructions of optimal locating arrays have not been studied systematically. Indeed, no useful lower bound has previously been determined, and only some sporadic examples of optimal locating arrays have been found. When a single fault is to be located, this article develops both a lower bound on the size of locating arrays and some methods of constructing optimal locating arrays. Some infinite series of optimal locating arrays are then obtained.

Original languageEnglish (US)
Pages (from-to)20-29
Number of pages10
JournalJournal of Statistical Theory and Practice
Issue number1
StatePublished - Mar 1 2012


  • Covering array
  • Interaction faults
  • Locating array

ASJC Scopus subject areas

  • Statistics and Probability


Dive into the research topics of 'Optimality and constructions of locating arrays'. Together they form a unique fingerprint.

Cite this