The Constructions Of Variable Strength Mixed Covering Arrays

With the rapid development of computer technology,software development is more and more important,and the testing of software systems becomes a key issue.The combinatorial test method based on the variable strength mixed covering arrays can use as few test cases as possible to effectively detect the interaction between components and the error detection ability of the test case set.Furthermore,the cost of detection can be reduced as much as possible.In recent years,the variable strength mixed covering array has become a hot topic in combinatorial design and software engineering due to its wide application value.In this paper,we study the constructions and existence of variable strength orthog-onal arrays and variable strength mixed covering arrays.In chapter 1,we mainly introduce the concepts of orthogonal arrays,variable strength mixed covering arrays and other related objects.In addition,we present the extension forms of covering arrays on hypergraphs and abstract single complexes,and summarize the research status and related results.In chapter 2,we construct some variable strength orthogonal arrays by using ordinary difference matrices and difference matrices with adderIn chapter 3,we get some recursive constructions of variable strength mixed orthog-onal arrays.In chapter 4,we give a new upper bound of the number of variable strength mixed covering arrays by using the probabilistic method which depends on the lovasz local lemma and "tiling probability model".