Wong, S. and Ooi, C. Y. and Hau, Y. W. and Marsono, M. N. and Shaikh-Husin, N. (2013) Feasible transition path generation for EFSM-based system testing. In: Proceedings - IEEE International Symposium on Circuits and Systems.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/ISCAS.2013.6572197
Abstract
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.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Subjects: | T Technology > TN Mining engineering. Metallurgy |
Divisions: | Malaysia-Japan International Institute of Technology |
ID Code: | 51068 |
Deposited By: | Haliza Zainal |
Deposited On: | 27 Jan 2016 01:53 |
Last Modified: | 17 Sep 2017 06:31 |
Repository Staff Only: item control page