Abstract
We address the problem of generating tests from a deterministic Finite State Machine to provide full fault coverage even if the faults may introduce extra states in the implementations. It is well-known that such tests should include the sequences in the so-called traversal set, which contains all sequences of length defined by the number of extra states. Therefore, the only apparent opportunity to produce shorter tests is to find within a test suite a suitable arrangement of the sequences in the inescapable traversal set. We observe that the direct concatenation of the traversal set to a given state cover, suggested by all existing generation methods with full fault coverage, results in extensive test branching, when a test has to be repeatedly executed to apply all the sequences of the traversal set. In this paper, we state conditions which allow distributing these sequences over several tests. We then utilize these conditions to elaborate a method, called SPY-method, which shortens tests by avoiding test branching as much as possible. We present the results of the experimental comparison of the proposed method with an existing method which indicate that the resulting save can be up to 40%.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bochmann, G.v., Petrenko, A.: Protocol testing: review of methods and relevance for software testing. In: ACM International Symposium on Software Testing and Analysis (ISSTA 1994), pp. 109–124. ACM Press, New York (1994)
Binder, R.: Testing Object-Oriented Systems. Addison-Wesley, Inc., Reading (2000)
Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178–187 (1978)
Dorofeeva, R., El-Fakih, K., Yevtushenko, N.: An improved conformance testing method. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 204–218. Springer, Heidelberg (2005)
Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. Softw. Eng. 17(6), 591–603 (1991)
Galil, Z., Italiano, G.F.: Data structures and algorithms for disjoint set union problems. ACM Comput. Surv. 23(3), 319–344 (1991)
Gonenc, G.: A method for the design of fault detection experiments. IEEE Trans. on Comput. 19(6), 551–558 (1970)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines - a survey. Proceedings of the IEEE. 84(8), 1090–1123 (1996)
Hennie, F.C.: Fault-detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Circuit Theory and Logical Design, Princeton, New Jersey, pp. 95–110 (1965)
Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Trans. on Comput. 55(5), 618–629 (2006)
Moore, E.F.: Gedanken-experiments on sequential machines. Automata Studies, Annals of Mathematical Studies (34), 129–153 (1956)
Petrenko, A., Higashino, T., Kaji, T.: Handling redundant and additional states in protocol testing. In: IFIP 8th Inter. Workshop on Protocol Test Systems, pp. 307–322. Chapman & Hall, Boca Raton (1995)
Vasilevskii, M.P.: Failure diagnosis of automata. Cybernetics 4, 653–665 (1973)
Yevtushenko, N., Petrenko, A.: Synthesis of test experiments in some classes of automata. Automatic Control and Computer Sciences 24(4), 50–55 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simão, A., Petrenko, A., Yevtushenko, N. (2009). Generating Reduced Tests for FSMs with Extra States. In: Núñez, M., Baker, P., Merayo, M.G. (eds) Testing of Software and Communication Systems. FATES TestCom 2009 2009. Lecture Notes in Computer Science, vol 5826. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05031-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-05031-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05030-5
Online ISBN: 978-3-642-05031-2
eBook Packages: Computer ScienceComputer Science (R0)