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.