启发式探索的协议测试序列生成

为避免可达性分析方法生成协议测试序列状态过程中爆炸问题的出现，提出了一种启发式探索协议状态格局空间的可执行测试序列生成算法. 该算法采用权值扩展有限状态机建模被测协议，以启发式状态格局探索策略替代传统的宽度优先搜索方式生成可执行协议测试序列；把协议可执行测试序列生成转化为在协议状态格局空间中探寻最小权值路径的问题. 实验数据表明，与宽度优先可达性分析方法相比，新算法具有较好的时空特性.

Test Sequence Generation of a Communication Protocol by an Heuristic State Configuration Exploration

Reachability analysis, which is widely used to generate executable protocol conformance test sequences, often causes state explosion problem. To overcome the problem, a heuristic state configuration exploration method is proposed. Using a weight extend finite state machine (WEFSM) as a protocol model, the new method employs the heuristic state configuration exploration to replace the traditional strategy of breadth-first-search. In this way, the generation of executable protocol conformance test sequences is reformulated to one of finding the minimum weight path in the whole state configuration space of a protocol implementation under test (IUT) problem. Experimental results show that, the proposed method needs to explore more less state configuration than the reachability analysis algorithm based on bread-first-search.