论文信息 - Construction of checking sequences based on characterization sets

Construction of checking sequences based on characterization sets

A general model for constructing checking sequences employing a characterization set for a given finite state machine is proposed. Some existing methods are shown to be special cases of the proposed model and are proven to construct checking sequences. Examples are provided as applications of the general model and its special cases.

Hasan Ural | Ali Rezaki | H. Ural | Ali Rezaki

[1] Krishan K. Sabnani,et al. Formal methods for generating protocol conformance test sequences , 1990, Proc. IEEE.

[2] David Lee,et al. Testing Finite State Machines: Fault Detection , 1995, J. Comput. Syst. Sci..

[3] Tsun S. Chow,et al. Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[4] Alfred V. Aho,et al. An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours , 1991, IEEE Trans. Commun..

[5] Ferhat Khendek,et al. Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[6] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[7] David Lee,et al. Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.

[8] Deepinder P. Sidhu,et al. Formal Methods for Protocol Testing: A Detailed Study , 1989, IEEE Trans. Software Eng..

[9] F. C. Hennine. Fault detecting experiments for sequential circuits , 1964, SWCT 1964.

[10] Arthur Gill,et al. Introduction to the theory of finite-state machines , 1962 .

[11] Sanjoy Paul,et al. On the generation of minimal-length conformance tests for communication protocols , 1993, TNET.

[12] Fabrizio Lombardi,et al. Protocol conformance testing using multiple UIO sequences , 1989, IEEE Trans. Commun..