Upper Bounds and Constructions of Locating Arrays

The use of locating arrays is motivated by the use of generating software test suites to locate interaction faults in component-based systems. In this paper, we introduce a new combinatorial configuration, with which a general combinatorial description of $(\bar{1},t)$-locating arrays is presented....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2021/05/01, Vol.E104.A(5), pp.827-833
Hauptverfasser:	SHI, Ce, FU, Jianfeng, WANG, Chengmin, YAN, Jie
Format:	Artikel
Sprache:	eng
Schlagworte:	Arrays Combinatorial analysis Computer Science Computer Science, Hardware & Architecture Computer Science, Information Systems construction covering arrays Engineering Engineering, Electrical & Electronic extendible Fault location locating arrays Science & Technology Software testing Technology upper bound Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The use of locating arrays is motivated by the use of generating software test suites to locate interaction faults in component-based systems. In this paper, we introduce a new combinatorial configuration, with which a general combinatorial description of $(\bar{1},t)$-locating arrays is presented. Based on this characterization, a number of locating arrays by means of SSOA and difference covering arrays with prescribed properties are constructed effectively. As a consequence, upper bounds on the size of locating arrays with small number of factors are then obtained.
ISSN:	0916-8508 1745-1337
DOI:	10.1587/transfun.2020EAL2081