Testing from partial deterministic FSM specifications

This paper addresses the problem of test generation from partially specified deterministic finite state machines (FSMs) that may have indistinguishable states and, thus, are not necessarily reduced (minimized). The known methods for checking experiments that are based on state identification are not applicable to unreduced machines. We propose the so-called state-counting approach that is directly applicable to unreduced FSMs. The approach generalizes the idea of state identification in test generation methods for deterministic machines.

[1]  David Lee,et al.  Testing finite state machines , 1991, STOC '91.

[2]  J. Esch.  Prolog to Principles and Methods of Testing Finite State Machines - A Survey , 1996 .

[3]  Alexandre Petrenko,et al.  Protocol testing: review of methods and relevance for software testing , 1994, ISSTA '94.

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

[5]  F. Joel Ferguson,et al.  Chesmin: a heuristic for state reduction in incompletely specified finite state machines , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[6]  Edward P. Hsieh,et al.  Checking Experiments ror Sequential Machines , 1971, IEEE Transactions on Computers.

[7]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[8]  Daniel P. Siewiorek,et al.  A method to automate user interface testing using variable finite state machines , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

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

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

[11]  Edward J. McCluskey,et al.  Derivation of optimum test sequences for sequential machines , 1964, SWCT.

[12]  G. Bochmann,et al.  Testing deterministic implementations from nondeterministic FSM specifications , 1996 .

[13]  Jehuda Kella.  Sequential Machine Identification , 1971, IEEE Transactions on Computers.

[14]  Irith Pomeranz,et al.  Test Generation for Multiple State-Table Faults in Finite-State Machines , 1997, IEEE Trans. Computers.

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

[16]  Monty Newborn,et al.  The Simplification of Sequential Machines with Input Restrictions , 1972, IEEE Transactions on Computers.

[17]  S. Seshu,et al.  Introduction to the theory of finite-state machines , 1963 .

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

[19]  Robert M. Hierons,et al.  Reduced Length Checking Sequences , 2002, IEEE Trans. Computers.

[20]  Nina Yevtushenko,et al.  Testing strategies for communicating FSMs , 1995 .

[21]  Hasan Ural,et al.  Construction of checking sequences based on characterization sets , 1995, Comput. Commun..

[22]  Guney Gonenc,et al.  A Method for the Design of Fault Detection Experiments , 1970, IEEE Transactions on Computers.

[23]  N. V. Evtushenko,et al.  Method of constructing a test experiment for an arbitrary deterministic automation , 1991 .

[24]  Richard Lai,et al.  A survey of communication protocol testing , 2002, J. Syst. Softw..

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

[26]  Zvi Kohavi,et al.  Checking experiments for sequential machines , 1974, Inf. Sci..

[27]  Fabio Somenzi,et al.  Don't care sequences and the optimization of interacting finite state machines , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[29]  Nina Yevtushenko,et al.  On Test Derivation from Partial Specifications , 2000, FORTE.

[30]  Alexandre Petrenko,et al.  Synthesis of test experiments in some classes of automata , 1991 .

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

[32]  Nina Yevtushenko,et al.  Nondeterministic State Machines in Protocol Conformance Testing , 1993, Protocol Test Systems.

[33]  Alexandre Petrenko,et al.  Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography , 2000, MOVEP.

[34]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

[35]  M. P. Vasilevskii.  Failure diagnosis of automata , 1973 .