A Combining Method for Wireless Protocol Conformance Testing: A Empirical Case

Algorithm 1

State covering set generation

Input: FSM M with n states {, ,…} and is the initial state, transition tree T and Root(T)=

Output: State covering set SC(M)

 1: Initialize SC(M)=ϕ

 2: for each transition starting with

 3: Add a branch in T and mark the branch with the input/output of the transition

 4: end for

 5: do

 6: for each leaf node appears for the first time in T

 7: Add a branch in T for each transition starting with the leaf node and mark the branch with the input/output of the transition

 8: end for

 9: until leaf node appears for the first time cannot be found in T

 10: for (i=1; i≤n; i++)

 11: Get an input/output sequence from to that appears for the first time in T

 12: SC(M)= SC(M)∪

 13: end for