A Novel Method of State Identification Sequences Generation for testing communication protocols modeled as Extended Finite State Machines
The existence of predicate and conditional statements of the protocol transition specified in EFSM model results in the generation of infeasible State Identification Sequence using traditional methods. Thus, how to automatically generate executable State Identification Sequences, in an efficient and effective way, becomes the critical issue for protocol conformance testing. In this paper, we present a novel method of executable state identification sequence generation used to preferably solve the executability, problem of state identification sequences. Specifically, in terms of an executable analysis tree (EAT), the proposed method can ensure the executability of the generated state identification sequence. In a specific state identification scene, we can use a state projection subspace to simplify the state identification work. At last, an example was performed to show that the new method is how to work effectively.
state identification sequence extended finite state machine protocol conformance test control flow algorithm
Ting Shu Shouqian Sun Haining Wang
College of Computer Science and Technology Zhejiang University Hangzhou, Zhejiang Province 310027, C College of Computer Science and Technology Zhejiang University Hangzhou, Zhejiang Province 310027, C
国际会议
温州
英文
1121-1126
2009-11-26（万方平台首次上网日期，不代表论文的发表时间）