APPLICATIONS OF SUFFICIENT PROTOCOL TEST-GENERATION

Protocols can be tested for conformance in shorter time with shorter test sequences. The problem of finding an optimal test sequence is; in general, combinatorially prohibitive. A method for the generation of optimal conformance test sequences, based on the Rural Chinese Postman Problem, is proposed recently. It has been shown that under certain conditions, efficient algorithms exist for constructing optimal length test sequences using this method. This paper points out some recently obtained results for the existence of efficient algorithms under a more general (i.e. weaker) set of sufficient conditions on a protocol FSM. We also show that under these conditions, efficient algorithms exist for the construction of test sequences in two other methods using Multiple UIOs (MUIO methods).