An Executable Protocol Test Sequence Generation Method for EFSM-specified Protocols
Chung‐Ming Huang, Yuan-Chuen Lin, Ming-Yuhe Jang · 1996
In this paper, we propose a method which can generate executable Extended Finite State Machine (EFSM)-based test sequences for data flow protocol test. In EFSM-specified protocols, the switch sequences can decide the executability of DO-paths. Based on the proposed Transition Executability Analysis (TEA) technique, executable switching sequences, executable DO-paths, and executable back paths, which are from the tail states of DO-paths to the initial state, can be derived. Then the complete executable data flow test sequence for an EFSM-specified protocol can be generated by concatenating the associated executable switching sequences, DO-paths, and back paths.