UIOE - A PROTOCOL TEST SEQUENCE GENERATION METHOD USING THE TRANSITION EXECUTABILITY ANALYSIS (TEA)

This paper presents a new test sequence generation method for protocol s that are specified in the Extended Finite State Machine (EFSM) model . The new method is called UIOE, which represents executable Unique In put/Output (UIO) sequences for EFSMs. Since EFSM-specified transitions may contain predicates in the condition parts, and may contain condit ional statements, e.g., if-then-else statements, in the action parts, the executabilities of input events and output events become complex. Additionally, shorter UIOs, which are generated without considering th e predicate issue, may not be the shorter executable UIOs. In EFSM-spe cified protocols, the switching sequence and the transition under test ing can decide the executability of a state's UIO. Thus, we propose a Transition Executability Analysis (TEA) to analyze executable transiti on sequences based on the initial state's context variables configurat ion. Consequently, each state's UIOE can be selected depending on the tail state's context variables configuration of the transition under t esting. (C) 1998 Elsevier Science B.V. All rights reserved.