Brunel University Research Archive (BURA) >
College of Engineering, Design and Physical Sciences >
Dept of Computer Science >
Dept of Computer Science Research Papers >

Please use this identifier to cite or link to this item:

Title: Generating feasible transition paths for testing from an extended finite state machine (EFSM) with the counter problem
Authors: Kalaji, AS
Hierons, RM
Swift, S
Keywords: Search-based testing
Model-based testing
Feasible transition paths
The counter problem
Automatic FTPs generation from EFSMs
Publication Date: 2010
Publisher: IEEE
Citation: Third IEEE International Conference on Software Testing Verification and Validation Workshops (ICSTW'10), Paris, pp. 232-235, Apr 2010
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).
Appears in Collections:Computer Science
Software Engineering (B-SERC)
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Fulltext.pdf317.03 kBAdobe PDFView/Open

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