Detecting Arrays and Their Optimality  

作　　者：Yu TANG Jian Xing YIN 

机构地区：[1]Department of Mathematics, Soochow University, Suzhou 215006, P. R. China

出　　处：《Acta Mathematica Sinica,English Series》2011年第12期2309-2318,共10页数学学报（英文版）

基　　金：Supported by National Natural Science Foundation of China （Grant Nos. 10801104 and 10831002）

摘　　要：Detecting arrays were proposed by Colbourn and McClary in 2008, which are of interest in generating software test suites to cover all t-sets of component interactions and detect interaction faults in component-based systems. So far, optimality and constructions of detecting arrays have not been studied systematically. Indeed, no useful benchmark to measure the optimality of detecting arrays has previously been given, and only some sporadic examples of optimal detecting arrays have been found. This paper tries to take the first step by presenting a lower bound on the size of detecting arrays and some methods of constructing optimal detecting arrays. A number of infinite series of optimal detecting arrays are then obtained.Detecting arrays were proposed by Colbourn and McClary in 2008, which are of interest in generating software test suites to cover all t-sets of component interactions and detect interaction faults in component-based systems. So far, optimality and constructions of detecting arrays have not been studied systematically. Indeed, no useful benchmark to measure the optimality of detecting arrays has previously been given, and only some sporadic examples of optimal detecting arrays have been found. This paper tries to take the first step by presenting a lower bound on the size of detecting arrays and some methods of constructing optimal detecting arrays. A number of infinite series of optimal detecting arrays are then obtained.

关 键 词：Detecting arrays interaction faults BOUNDS OPTIMALITY CONSTRUCTIONS 

分 类 号：TP303[自动化与计算机技术—计算机系统结构] TN215[自动化与计算机技术—计算机科学与技术]