Bipartite Locating Array
| Autor: | Zong Feng Qi, Wen Jie Zhong, Yu Tang |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Single fault
Applied Mathematics General Mathematics 0102 computer and information sciences 01 natural sciences Measure (mathematics) Upper and lower bounds 010104 statistics & probability Construction method 010201 computation theory & mathematics Component (UML) Bipartite graph 0101 mathematics Special case Algorithm Mathematics |
| Zdroj: | Acta Mathematica Sinica, English Series. 36:179-188 |
| ISSN: | 1439-7617 1439-8516 |
| Popis: | As a special case of experimental design, locating array is useful for locating interaction faults in component-based systems. In this paper, bipartite locating array is proposed to locate interaction faults between two specific groups. Such arrays are especially suitable for antagonism tests. Based on the definition of bipartite locating array, the lower bound on run sizes are established to measure the optimality for specific parameters. When a single fault is to be located, optimal bipartite locating arrays are proved to be equivalent to certain specific combinatorial configurations. As a result, approaches to constructing optimal bipartite locating arrays are proposed and some infinite classes of optimal bipartite locating arrays are obtained using the corresponding construction method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|