A conformance testing for communication protocols modeled as a set of DFSMs with common inputs

In this paper, we propose an effective conformance testing method for a subclass of protocols modeled as a set of DFSMs. The number of test cases in the proposed method is only proportional to the sum of those of states and transitions in a given set of DFSMs. In our method, we find a characterization set for each DFSM, which is used to test the DFSM alone in WP-method, and the union of the characterization sets is used as a characterization set for the total system. For a set of DFSMs with common inputs, there may exist two or more tuples of states that have correct responses against a given characterization set. So, in order to identify each state s in a DFSM, we find a characterization set with some specific properties. Then we select a suitable tuple of states containing the state s, and identify the state s by checking their response to the characterization set.