This paper addresses the problem of conformance testing of protocols modeled by FSMs with redundant states. Redundant states appear in an FSM which may be nonminimal or nonconnected. The existing test derivation methods usually are not directly applicable to these machines. In this paper, we show that they can be adjusted to cover this class of FSMs and that the traditional assumption on the minimality of machines is not necessary. Another problem with redundant states is that they can cause the appearance of additional states in protocol implementations whose guaranteed detection requires tests of an exponential length. This paper proposes techniques for deriving tests for FSMs with redundant or additional states such that a high fault coverage is achieved while maintaining an acceptable test suite length. The effectiveness of the proposed methods has been evaluated in an experimental way using a benchmark protocol.

No abstract

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 8 in a DFSM, we find a characterization set with some specific properties. Then we select a suitable