期刊检索

  • 2024年第56卷
  • 2023年第55卷
  • 2022年第54卷
  • 2021年第53卷
  • 2020年第52卷
  • 2019年第51卷
  • 2018年第50卷
  • 2017年第49卷
  • 2016年第48卷
  • 2015年第47卷
  • 2014年第46卷
  • 2013年第45卷
  • 2012年第44卷
  • 2011年第43卷
  • 2010年第42卷
  • 第1期
  • 第2期

主管单位 中华人民共和国
工业和信息化部
主办单位 哈尔滨工业大学 主编 李隆球 国际刊号ISSN 0367-6234 国内刊号CN 23-1235/T

期刊网站二维码
微信公众号二维码
引用本文:段嘉奇,林明达,周晴.面向全迁移的小规模EFSM测试序列集生成方法[J].哈尔滨工业大学学报,2023,55(10):27.DOI:10.11918/202205116
DUAN Jiaqi,LIN Mingda,ZHOU Qing.Generation method of small-scale EFSM test sequence suite for all transitions[J].Journal of Harbin Institute of Technology,2023,55(10):27.DOI:10.11918/202205116
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  下载PDF阅读器  关闭
过刊浏览    高级检索
本文已被:浏览 973次   下载 1281 本文二维码信息
码上扫一扫!
分享到: 微信 更多
面向全迁移的小规模EFSM测试序列集生成方法
段嘉奇1,2,林明达1,2,周晴1
(1.复杂航天系统电子信息技术重点实验室(中国科学院国家空间科学中心),北京 100190; 2.中国科学院大学,北京 100049)
摘要:
针对在扩展有限状态机(extended finite state machine, EFSM)模型上测试序列集生成效率低、规模大等问题,提出了一种面向全迁移的小规模测试序列集生成方法。该方法基于改进的自适应多种群遗传算法(improved adaptive multi-population genetic algorithm, IAMGA)。首先,利用迁移覆盖增益设计适应度函数,使每次生成的可行迁移路径均能产生迁移覆盖增益;然后,根据个体的可行迁移划分子种群,并在子种群内使用轮盘赌算法进行选择,克服了“早熟”问题,提高了全迁移覆盖的成功率;再利用种群的平均路径通过率自适应地调整交叉和变异概率,加快了收敛速度;最后,通过倒序遍历测试序列集去除冗余序列,进一步压缩了测试序列集规模。实验结果表明,与面向单迁移的测试序列生成方法相比,本文所提出的测试序列生成方法面向全迁移,仅一次就能以90%以上的成功率生成满足全迁移覆盖的测试序列集;与传统的遗传算法相比,IAMGA算法生成的测试序列集的平均规模减少了50%,平均迭代次数也减少了20%。本文提出的测试序列集生成方法可有效提高EFSM测试序列集生成的效率和质量。
关键词:  扩展有限状态机  测试序列集生成  自适应  多种群  遗传算法
DOI:10.11918/202205116
分类号:TP311.5
文献标识码:A
基金项目:民用航天技术“十三五”预先研究基金(B0204)
Generation method of small-scale EFSM test sequence suite for all transitions
DUAN Jiaqi1,2,LIN Mingda1,2,ZHOU Qing1
(1.Key Laboratory of Electronics and Information Technology for Space Systems(National Space Science Center, Chinese Academy of Sciences), Beijing 100190, China; 2.University of Chinese Academy of Sciences, Beijing 100049, China)
Abstract:
In order to address the issues of low efficiency and large scale of test sequence suite on the extended finite state machine (EFSM) model, a method of small-scale EFSM test sequence suite generation for all transitions was proposed based on the improved adaptive multi-population genetic algorithm (IAMGA). Firstly, the fitness function was designed by the transition coverage gain so that each generated feasible transition path can improve transition coverage. Next, the individual was selected within the subpopulations divided by feasible transition paths, which can overcome the premature convergence and improve the success rate of all transitions coverage. Then, the probabilities of crossover and mutation were adaptively adjusted based on the average path pass rate of the population so as to speed up convergence. Finally, by traversing the test sequence suite in reverse order, redundant sequences were removed, which further reduced the size of the test sequence suite. The experimental results show that compared with the generation test sequence method for single transition, this method which is designed for all transitions, can generate a test sequence suite that meets all transitions coverage with a success rate of more than 90% at a time. Compared with the traditional genetic algorithm, the average size of test sequence suite generated by IAMGA is reduced by 50%, while the average number of iterations is reduced by 20%. The method proposed in this paper can effectively improve the efficiency and quality of the generating EFSM test sequence suite.
Key words:  extended finite state machine  test sequence suite generation  adaptive  multi-population  genetic algorithm

友情链接LINKS