Expanding an Extended Finite State Machine to aid Testability

Authors:
Robert M. Hierons;T.-H. Kim;Hasan Ural
Affiliations:
-;-;-
Venue:
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Year:
2002

Citing 0
Cited 3

On the testability of SDL specifications

Computer Networks: The International Journal of Computer and Telecommunications Networking
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine

Theoretical Computer Science
Efficient Generation of Stimuli for Functional Verification by Backjumping Across Extended FSMs

Journal of Electronic Testing: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.