摘要
状态测试的首要问题就是从大量的状态组合中挑选针对典型的错误能够最为有效和最为优化的测试序列。A.V.Aho等人提出了使用中国邮路算法及UIO序列进行生成测试序列的方法,但并没有考虑UIO序列的加入对状态迁移造成的影响,因此不能够对测试序列进行全局优化。该文对上述算法进行改进,并使用遗传算法解决了中国邮路NP-Complete问题。
The cardinal important thing of state test is to select the most efficient and optimize test sequence against typical error.A.V.Aho proposed a method of using Rural Chinese Postman algorithm and UIO sequences to generate test sequence,but he did not consider the effect of state transition when adding UIO sequences,so the method can not gain a global optimized test sequence.In This paper,we have improved the above algorithm and solves the NP-Complete problem of Rural Chinese Postman through GA.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第17期58-60,共3页
Computer Engineering and Applications
基金
陕西省教育厅科研基金项目(编号:00JK265)
