EFSM可执行状态验证序列的生成

在以扩展有限状态机(EFSM)为模型描述的协议一致性测试系统中，为了解决状态验证序列的可执行性问题，提出了一种新的可执行状态验证序列(ESIS)生成算法。新算法基于宽度优先搜索可执行分析树(EAT)的思想，从状态验证需求的角度，在EFSM的状态格局投影子空间中，采用分步计算的方式生成具体验证场景下的最短可执行状态验证序列，从而减少了在完全状态格局空间中单步计算所有状态验证序列的复杂性。实验结果表明了新算法对生成EFSM可执行状态验证序列是有效的。

A Novel Algorithm for Generating Executable State Identification Sequences in EFSM Model

In a protocol conformance testing system specified in the extended finite state machine(EFSM) model,a new method of executable state identification sequences(ESIS) generation is introduced to preferably solve the executability problem of state identification sequences(SIS).From the aspect of state identification demand and the EFSM configure projection subspace,an fractional-step computation is adopted to generate the shortest ESIS in the specific identification scene through searching an executability analysis tree(EAT) in bread-first-search way.As a result,the complexity of computing all state identification sequences using single-step method in the whole state configure space will be avoided.The experiment results show that the proposed algorithm is effective to generate executable state identification sequences in EFSM model.