publication . Conference object . 2009

Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) with the Counter Problem

Abdul Salam Kalaji; Robert Hierons; Stephen Swift;
Open Access English
  • Published: 23 Oct 2009
  • Publisher: IEEE
  • Country: United Kingdom
Abstract
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).
Subjects
free text keywords: Search-based testing, Model-based testing, Feasible transition paths, The counter problem, Automatic FTPs generation from EFSMs, Computer science, Automaton, Guard (information security), Finite-state machine, Genetic algorithm, System testing, Extended finite-state machine, Loop counter, Algorithm
Related Organizations
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue