Please use this identifier to cite or link to this item:
Title: Expanding an extended finite state machine to aid testability
Authors: Hierons, RM
Kim, TH
Ural, H
Keywords: Extended finite state machine;Testability;Infeasible paths
Issue Date: 2002
Publisher: IEEE
Citation: 26th IEEE Annual International Computer Software and Applications Conference (COMPSAC 2002), pp. 334-339, August 2002.
Abstract: The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in order to bypass the infeasible path problem. The approach is developed for the specification language SDL but, in order to aid generality, the rewriting process is broken down into two phases: producing a normal form EFSM (NF-EFSM) from an SDL specification and then expanding this NF-EFSM.
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Fulltext.pdf282.76 kBAdobe PDFView/Open

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