Abstract
In this paper, a transition tours generating method is proposed for the conformance testing of communication protocols. Given a protocol specification specified by the extended finite state machine (EFSM) model, the proposed method is able to generate transition tours that tests every transition at least once. In this thesis, we first find the executability of EFSM by using connectivity in EFSM. Second, we reduce the original EFSM to a simplified EFSM which describes the characteristic of this EFSM. Third, the transtion tours generating algorithm is proposed to obtain the executable test sequence for the simplified EFSM which is also a test sequence traveling each transition of the original EFSM at least once.