论文信息 - A test generation algorithm for systems modelled as non-deterministic FSMs

A test generation algorithm for systems modelled as non-deterministic FSMs

A variety of systems can be modelled as finite-state machines (FSM). Several formal methods have been proposed for testing the conformance of an implementation to a given FSM-based specification. However, all of these methods assume that the specification is modelled by a deterministic FSM. The paper presents an efficient algorithm that generates a set of adaptive all state-pair optimised distinguishing sequences for testing systems modelled as non-deterministic FSMs. >

[1] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .

[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üney Gönenç,et al. A Method for the Design of Fault Detection Experiments , 1970 .

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

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

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

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

[8] Krishan K. Sabnani,et al. An algorithmic procedure for checking safety properties of protocols , 1989, IEEE Trans. Commun..

[9] Krishan K. Sabnani,et al. A Protocol Test Generation Procedure , 1988, Comput. Networks.

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

[11] Hasan Ural,et al. Formal methods for test sequence generation , 1992, Comput. Commun..

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