Abstract
In this thesis, given an Finite State Machine (FSM) modeled protocol and its test cases, we discuss the problems of test case variation when the protocol has been modified. While the test cases were generated by Unique Input Out (UIO) method, we find some properties of these variation and present efficient methods to solve these problems. In consequence, we add some necessary test cases into test case set to test the new protocol. With this method, we can avoid reconstructing the whole set of test cases of UIO, which is a P-space complete problem [11].