Testing Finite-State Machines: State Identification and Verification

We study the complexity of two fundamental problems in the testing of finite-state machines. 1) Distinguishing sequences (state identification). We show that it is PSPACE-complete to determine whether a finite-state machine has a preset distinguishing sequence. There are machines that have distinguishing sequences, but only of exponential length. We give a polynomial time algorithm that determines whether a finite-state machine has an adaptive distinguishing sequence. (The previous classical algorithms take exponential time.) Furthermore, if there is an adaptive distinguishing sequence, then we give an efficient algorithm that constructs such a sequence of length at most n(n/spl minus/1)/2 (which is the best possible), where n is the number of states. 2) Unique input output sequences (state verification). It is PSPACE-complete to determine whether a state of a machine has a unique input output sequence. There are machines whose states have unique input output sequences but only of exponential length. >

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

[2]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  S. M. Gobershtein.  Check words for the states of a finite automaton , 1974 .

[4]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

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

[6]  Arthur D. Friedman,et al.  Fault detection in digital circuits , 1971 .

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

[8]  F. C. Hennie.  Fault detecting experiments for sequential circuits , 1964, SWCT.

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

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

[11]  Z. Kohavi,et al.  Variable-Length Distinguishing Sequences and Their Application to the Design of Fault-Detection Experiments , 1968, IEEE Transactions on Computers.

[12]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

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

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

[15]  David Lee,et al.  Online minimization of transition systems (extended abstract) , 1992, STOC '92.

[16]  Sanjoy Paul,et al.  Generating minimal length test sequences for conformance testing of communication protocols , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[17]  M. N. Sokolovskii.  Diagnostic experiments with automata , 1971, Cybernetics.

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

[19]  Wen-Huei Chen,et al.  An Optimization Technique for Protocol Conformance Testing Using Multiple Uio Sequences , 1990, Inf. Process. Lett..

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

[21]  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..

[22]  Yanghee Choi,et al.  Approaches utilizing segment overlap to minimize test sequences , 1990, PSTV.

[23]  W. Y. L. Chan,et al.  An improved protocol test generation procedure based on UIOS , 1989, SIGCOMM 1989.

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

[25]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[26]  H. Ural,et al.  Protocol conformance test generation using multiple UIO sequences with overlapping , 1990, SIGCOMM 1990.

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