Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) with the Counter Problem
Software Testing Verification and Validation Workshop, IEEE International Conference on (2010)
Apr. 6, 2010 to Apr. 10, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSTW.2010.25
The extended finite state machine (EFSM) is a powerful approach for modeling state-based systems. However, testing from EFSMs is complicated by the existence of infeasible paths. One important problem is the existence of a transition with a guard that references a counter variable whose value depends on previous transitions. The presence of such transitions in paths often leads to infeasible paths. This paper proposes a novel approach to bypass the counter problem. The proposed approach is evaluated by being used in a genetic algorithm to guide the search for feasible transition paths (FTPs).
Search-Based Software Testing, Testing from Extended Finite State Machine (EFSM), Generating Feasible Transition Paths (FTPs), the Counter Problem
Abdul Salam Kalaji, Stephen Swift, Robert Mark Hierons, "Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) with the Counter Problem", Software Testing Verification and Validation Workshop, IEEE International Conference on, vol. 00, no. , pp. 232-235, 2010, doi:10.1109/ICSTW.2010.25