Generating Executable Tests for Timed and Untimed EFSM Models

摘要

The complexity of communication systems necessitates the replacement of simpler finite-state machine (FSM) models with the timed or untimed extended finite-state machine (EFSM) models. However, due to the infeasible paths caused by in-terdependencies among the context or timing variables, the generation of only feasible test sequences automatically from the EFSMs remains an open research problem. If the conflicts among the action, condition, and timing variables of the EFSM are not resolved, a portion of the generated test sequences may not be realized in a test laboratory. A methodology enabling the generation of only feasible test sequences from the EFSMs is described. Algorithms to detect and resolve conflicts among the EFSM actions and conditions are presented. The resulting EFSM graph after the conflicts are resolved can be an input to the FSM-based test generation methods reported in the literature.