Brunel University Research Archive (BURA) >
Research Areas >
Software Engineering (B-SERC) >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2814

Title: Generating feasible transition paths for testing from an extended finite state machine (EFSM)
Authors: Kalaji, AS
Hierons, RM
Swift, S
Keywords: Genetic algorithm
Feasible transition paths (FTPs)
Model-based testing
Automatic test sequence generation
Extended finite state machine (EFSM)
Fitness metric
Path feasibility
EFSM testing
Generating feasible transition paths
Publication Date: 2008
Publisher: IEEE
Citation: 2nd IEEE International Conference on Software Testing Verification and Validation (ICST09), Denver, pp. 230-239, Apr 2009
Abstract: The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the paths. A chosen path may be infeasible and so it is desirable to have methods that can direct the search for appropriate paths through the EFSM towards those that are likely to be feasible. However, generating feasible transition paths (FTPs) for model based testing is a challenging task and is an open research problem. This paper introduces a novel fitness metric that analyzes data flow dependence among the actions and conditions of the transitions in order to estimate the feasibility of a transition path. The proposed fitness metric is evaluated by being used in a genetic algorithm to guide the search for FTPs.
URI: http://bura.brunel.ac.uk/handle/2438/2814
http://dx.doi.org/10.1109/ICST.2009.29
Appears in Collections:Computer Science
Software Engineering (B-SERC)
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM).pdf436.22 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.