摘要
A novel interoperability test sequences optimization scheme is proposed in which the genetic algorithm (GA) is used to obtain the minimal-length interoperability test sequences. During our work, the basic interoperability test sequences are generated based on the minimal-complete-coverage criterion, which removes the redundancy from conformance test sequences. Then interoperability sequences minimization problem can be considered as an instance of the set covering problem, and the GA is applied to remove redundancy in interoperability transitions. The results show that compared to conventional algorithm, the proposed algorithm is more practical to avoid the state space explosion problem, for it can reduce the length of the test sequences and maintain the same transition coverage.
源语言 | 英语 |
---|---|
页(从-至) | 341-345 |
页数 | 5 |
期刊 | Journal of Beijing Institute of Technology (English Edition) |
卷 | 17 |
期 | 3 |
出版状态 | 已出版 - 9月 2008 |