Expanding an extended finite state machine to aid testability

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hierons, RM	-
dc.contributor.author	Kim, TH	-
dc.contributor.author	Ural, H	-
dc.coverage.spatial	6	en
dc.date.accessioned	2009-06-08T12:48:54Z	-
dc.date.available	2009-06-08T12:48:54Z	-
dc.date.issued	2002	-
dc.identifier.citation	26th IEEE Annual International Computer Software and Applications Conference (COMPSAC 2002), pp. 334-339, August 2002.	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3391	-
dc.description.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.	en
dc.format.extent	289548 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	IEEE	en
dc.subject	Extended finite state machine	en
dc.subject	Testability	en
dc.subject	Infeasible paths	en
dc.title	Expanding an extended finite state machine to aid testability	en
dc.type	Conference Paper	en
Appears in Collections:	Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC)

Files in This Item:

File	Description	Size	Format
Fulltext.pdf		282.76 kB	Adobe PDF	View/Open