By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kalaji, A.S. ; Sch. of Inf. Syst., Math. & Comput., Brunel Univ., Uxbridge, UK ; Hierons, R.M. ; Swift, S.

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).

Published in:

Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on

Date of Conference:

6-10 April 2010