Expanding an Extended Finite State Machine to aid Testability

Oxford, England August 26-August 29

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2002.1045023

26th Annual International Computer So ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by R. M. Hierons Articles by T.-H. Kim Articles by H. Ural

	ASCII Text	x
	R. M. Hierons, T.-H. Kim, H. Ural, "Expanding an Extended Finite State Machine to aid Testability," Computer Software and Applications Conference, Annual International, pp. 334, 26th Annual International Computer Software and Applications Conference, 2002.

	BibTex	x
	@article{ 10.1109/CMPSAC.2002.1045023, author = {R. M. Hierons and T.-H. Kim and H. Ural}, title = {Expanding an Extended Finite State Machine to aid Testability}, journal ={Computer Software and Applications Conference, Annual International}, volume = {0}, year = {2002}, issn = {0730-3157}, pages = {334}, doi = {http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2002.1045023}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Software and Applications Conference, Annual International TI - Expanding an Extended Finite State Machine to aid Testability SN - 0730-3157 SP EP A1 - R. M. Hierons, A1 - T.-H. Kim, A1 - H. Ural, PY - 2002 KW - extended finite state machine KW - testability KW - infeasible paths VL - 0 JA - Computer Software and Applications Conference, Annual International ER -

R. M. Hierons, Brunel University

T.-H. Kim, University of Ottawa

H. Ural, University of Ottawa

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.

Index Terms:

extended finite state machine, testability, infeasible paths

Citation:

R. M. Hierons, T.-H. Kim, H. Ural, "Expanding an Extended Finite State Machine to aid Testability," compsac, pp.334, 26th Annual International Computer Software and Applications Conference, 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.