This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
October 2004 (vol. 53 no. 10)
pp. 1330-1342
The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point.

[1] H. AboElFotoh, O. Abou-Rabia, and H. Ural, A Test Generation Algorithm For Protocols Modeled as Non-Deterministic FSMs The Software Eng. J., vol. 8, no. 4, pp. 184-188, 1993.
[2] R. Alur, C. Courcoubetis, and M. Yannakakis, Distinguishing Tests for Nondeterministic and Probabilistic Machines Proc. 27th ACM Symp. Theory of Computing, pp. 363-372, 1995.
[3] S. Yu Boroday, Distinguishing Tests for Non-Deterministic Finite State Machines Proc. Testing of Communicating Systems, IFIP TC6 11th Int'l Workshop Testing of Communicating Systems, pp. 101-107, 1998.
[4] T.S. Chow, Testing Software Design Modelled by Finite State Machines IEEE Trans. Software Eng., vol. 4, pp. 178-187, 1978.
[5] S. Fujiwara and G. v. Bochmann, Testing Non-Deterministic State Machines with Fault Coverage Proc. Protocol Test Systems IV, pp. 267-280, 1991.
[6] D. Harel and M. Politi, Modeling Reactive Systems with Statecharts: The STATEMATE Approach. New York: McGraw-Hill, 1998.
[7] R.M. Hierons, Adaptive Testing of a Deterministic Implementation against a Nondetermistic Finite State Machine The Computer J., vol. 41, no. 5, pp. 349-355, 1998.
[8] R.M. Hierons and H. Ural, Concerning the Ordering of Adaptive Test Sequences Proc. 23rd IFIP Int'l Conf. Formal Techniques for Networked and Distributed Systems (FORTE 2003), pp. 289-302, 2003.
[9] ITU-T, Recommendation Z.100 Specification and Description Language (SDL). Geneva: Int'l Telecomm. Union, 1999.
[10] D. Lee and M. Yannakakis, Principles and Methods of Testing Finite State Machines, a Survey Proc. IEEE, vol. 84, no. 8, pp. 1090-1123, Aug. 1996.
[11] G. Luo, G.V. Bochman, and A. Petrenko, “Test Selection Based on Communicating Nodetermistic Finite State Machines Using a Generalized wp-Method,” IEEE Trans. Software Eng., vol. 20, no. 2, pp. 149-162, Feb. 1994.
[12] A. Petrenko, N. Yevtushenko, A. Lebedev, and A. Das, Nondeterministic State Machines in Protocol Conformance Testing Proc. Protocol Test Systems, VI (C-19), pp. 363-378, Sept. 1994.
[13] A. Petrenko, N. Yevtushenko, and G. v. Bochmann, Testing Deterministic Implementations from Nondeterministic FSM Specifications Proc. Testing of Communicating Systems, IFIP TC6 Ninth Int'l Workshop Testing of Communicating Systems, pp. 125-141, Sept. 1996.
[14] P.H. Starke, Abstract Automata. North-Holland, Amsterdam: Elsevier, 1972.
[15] J. Tretmans, Conformance Testing with Labelled Transitions Systems:Implementation Relations And Test Generation Computer Networks and ISDN Systems, vol. 29, no. 1, pp. 49-79, 1996.
[16] P. Tripathy and K. Naik, Generation of Adaptive Test Cases from Non-Deterministic Finite State Models Proc. Fifth Int'l Workshop Protocol Test Systems, pp. 309-320, Sept. 1992.
[17] M.P. Vasilevskii, Failure Diagnosis of Automata Cybernetics, vol. 4, pp. 653-665, 1973.
[18] N.V. Yevtushenko, A.V. Lebedev, and A.F. Petrenko, On Checking Experiments with Nondeterministic Automata Automatic Control and Computer Sciences, vol. 6, pp. 81-85, 1991.

Index Terms:
Software engineering, software/program verification, testing and debugging, nondeterministic finite state machine, adaptive testing, state counting.
Citation:
Rob M. Hierons, "Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting," IEEE Transactions on Computers, vol. 53, no. 10, pp. 1330-1342, Oct. 2004, doi:10.1109/TC.2004.85
Usage of this product signifies your acceptance of the Terms of Use.