Using a minimal number of resets when testing from a finite state machine
暂无分享,去创建一个
[1] Alexandre Petrenko,et al. Conformance Testing of Protocol Machines without Reset , 1993, PSTV.
[2] 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..
[3] G. Bochmann,et al. Testing deterministic implementations from nondeterministic FSM specifications , 1996 .
[4] Carl A. Sunshine,et al. Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.
[5] James A. McHugh,et al. Algorithmic Graph Theory , 1986 .
[6] David Lee,et al. Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.
[7] Ferhat Khendek,et al. Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..
[8] Deepinder P. Sidhu,et al. Formal Methods for Protocol Testing: A Detailed Study , 1989, IEEE Trans. Software Eng..
[9] A. Church. Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies , edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153. , 1958, Journal of Symbolic Logic.
[10] Bart M. Broekman,et al. Testing Enbredded Software , 2002 .