Executable test sequence for the protocol control and data portions

A new method is proposed to generate the executable test sequence which simultaneously verifies the protocol control and data portions, that are respectively modeled as a deterministic finite state machine (FSM) and a set of rules between parameter values. The method involves converting the FSM and rules into a SelectO digraph, whose tour can be used to generate the test sequence associated with feasible parameter values that verifies the transitions of the FSM and the rules. The selecting Chinese postman algorithm is used to find a specific tour for minimizing the length of the test sequence that verifies each transition and each rule at least once. Experimentation on the simple session protocol indicates that an executable test sequence can be achieved which is 37% shorter than that achieved by testing the two portions separately