Feasible transition path generation for EFSM-based system testing
This paper presents a feasible transition path (FTP) generation approach for testing extended finite state machines (EFSM). The major problem faced by EFSM-based testing is the existence of the infeasible paths due to conflict of the context variable with the enable conditions in the transition path...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/51068/ http://dx.doi.org/10.1109/ISCAS.2013.6572197 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a feasible transition path (FTP) generation approach for testing extended finite state machines (EFSM). The major problem faced by EFSM-based testing is the existence of the infeasible paths due to conflict of the context variable with the enable conditions in the transition path. In order to avoid infeasible path generation, this paper proposed an approach that uses the modified breadth first search with conflict checker to generate a set of minimum FTP for each transition. An EFSM executable model is developed for algorithm modeling and verification as well as performance evaluation. Experimental results conducted on two EFSM models showed that the proposed approach is able to generate feasible transition path with at least 18% path length reduction. |
|---|