Sciweavers

Share
COMPSAC
2002
IEEE

Expanding an Extended Finite State Machine to aid Testability

10 years 4 months ago
Expanding an Extended Finite State Machine to aid Testability
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.
Robert M. Hierons, T.-H. Kim, Hasan Ural
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where COMPSAC
Authors Robert M. Hierons, T.-H. Kim, Hasan Ural
Comments (0)
books