This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Checking Completeness of Tests for Finite State Machines
August 2010 (vol. 59 no. 8)
pp. 1023-1032
Adenilso Simao, Universidade de Sao Paulo, Sao Carlos
Alexandre Petrenko, CRIM, Montreal
In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test suite to be complete. We demonstrate that the existing conditions are special cases of the proposed ones. An algorithm that checks whether a given test suite is complete is given. The experimental results show that the algorithm can be used for relatively large FSMs and test suites.

[1] T.S. Chow, "Testing Software Design Modeled by Finite-State Machines," IEEE Trans. Software Eng., vol. 4, no. 3, pp. 178-187, May 1978.
[2] R. Dorofeeva, K. El-Fakih, and N. Yevtushenko, "An Improved Conformance Testing Method," Formal Techniques for Networked and Distributed Systems, pp. 204-218, Springer, 2005.
[3] R. Dorofeeva, N. Yevtushenko, K. El-Fakih, and A.R. Cavalli, "Experimental Evaluation of FSM-Based Testing Methods," Proc. Third IEEE Int'l Conf. Software Eng. and Formal Methods, pp. 23-32, 2005.
[4] S. Fujiwara, G.v. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi, "Test Selection Based on Finite State Models," IEEE Trans. Software Eng., vol. 17, no. 6, pp. 591-603, June 1991.
[5] G. Gonenc, "A Method for the Design of Fault Detection Experiments," IEEE Trans. Computers, vol. 19, no. 6, pp. 551-558, June 1970.
[6] S. Gören and F.J. Ferguson, "On State Reduction of Incompletely Specified Finite State Machines," Computers & Electrical Eng., vol. 33, no. 1, pp. 58-69, 2007.
[7] T. Grunert, S. Irnich, H.-J. Zimmermann, M. Schneider, and B. Wulfhorst, "Finding All k-Cliques in k-Partite Graphs: An Application in Textile Engineering," Computers & Operations Research, vol. 29, pp. 13-31, 2002.
[8] F.C. Hennie, "Fault-Detecting Experiments for Sequential Circuits," Proc. Fifth Ann. Symp. Circuit Theory and Logical Design, pp. 95-110, 1964.
[9] R.M. Hierons and H. Ural, "Reduced Length Checking Sequences," IEEE Trans. Computers, vol. 51, no. 9, pp. 1111-1117, Sept. 2002.
[10] R.M. Hierons and H. Ural, "Optimizing the Length of Checking Sequences," IEEE Trans. Computers, vol. 55, no. 6, pp. 618-629, May 2006.
[11] R.M. Karp, "Reducibility Among Combinatorial Problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, eds., pp. 85-103, Springer, 1972.
[12] E.P. Moore, "Gedanken-Experiments," Automata Studies, C. Shannon and J. McCarthy, eds., Princeton Univ. Press, 1956.
[13] J.M. Pena and A.L. Oliveira, "A New Algorithm for Exact Reduction of Incompletely Specified Finite State Machines," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 18, no. 11, pp. 1619-1632, Nov. 1999.
[14] A. Petrenko, G.v. Bochmann, and M. Yao, "On Fault Coverage of Tests for Finite State Specifications," Computer Networks and ISDN Systems, special issue on protocol testing, vol. 29, pp. 81-106, 1996.
[15] A. Petrenko and N. Yevtushenko, "Testing from Partial Deterministic FSM Specifications," IEEE Trans. Computers, vol. 54, no. 9, pp. 1154-1165, Sept. 2005.
[16] J.F. Poage and E.J. McCluskeyJr., "Derivation of Optimal Test Sequences for Sequential Machines," Proc. IEEE Fifth Symp. Switching Circuits Theory and Logical Design, pp. 121-132, 1964.
[17] M.P. Vasilevskii, "Failure Diagnosis of Automata," Cybernetics, vol. 4, pp. 653-665, 1973.
[18] H. Ural, X. Wu, and F. Zhang, "On Minimizing the Lengths of Checking Sequences," IEEE Trans. Computers, vol. 46, no. 1, pp. 93-99, Jan. 1997.
[19] M. Yao, A. Petrenko, and G.v. Bochmann, "Fault Coverage Analysis in Respect to an FSM Specification," Proc. IEEE INFOCOM '94, pp. 768-775, 1994.
[20] N. Yevtushenko and A. Petrenko, "Synthesis of Test Experiments in Some Classes of Automata," Automatic Control and Computer Sciences, vol. 24, no. 4, pp. 50-55, 1990.

Index Terms:
Finite State Machine, test analysis, fault coverage, test completeness conditions, test generation.
Citation:
Adenilso Simao, Alexandre Petrenko, "Checking Completeness of Tests for Finite State Machines," IEEE Transactions on Computers, vol. 59, no. 8, pp. 1023-1032, Aug. 2010, doi:10.1109/TC.2010.17
Usage of this product signifies your acceptance of the Terms of Use.