Abstract
The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is proposed for partial reduced FSMs with distinguishing sets, and either with or without reset feature. Sufficient conditions for a sequence to be a checking sequence for such FSMs are formulated. Based on these conditions, a method to generate checking sequence is elaborated. The results of an experimental comparison indicate that the proposed method produces shorter checking sequences than existing methods in most cases. The impact of using the reset feature on the length of checking sequence is also experimentally evaluated.
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
Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.U.: An optimization technique for protocol conformance test generation based on UIO sequences and rural chinese postman tours. IEEE Transactions on Communications 39(11), 1604–1615 (1991)
Boute, R.T.: Distinguishing sets for optimal state identification in checking experiments. 23(8), 874–877 (1974)
Chen, J., Hierons, R.M., Ural, H., Yenigun, H.: Eliminating redundant tests in a checking sequence. In: Khendek, F., Dssouli, R. (eds.) TestCom 2005. LNCS, vol. 3502, pp. 146–158. Springer, Heidelberg (2005)
Gonenc, G.: A method for the design of fault detection experiments. IEEE Transactions on Computers 19(6), 551–558 (1970)
Hennie, F.C.: Fault-detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Circuit Theory and Logical Design, pp. 95–110 (1965)
Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Transactions on Computers 51(9), 1111–1117 (2002)
Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Transactions on Computers 55(5), 618–629 (2006)
Kohavi, I., Kohavi, Z.: Variable-length distinguishing sequences and their application to the design of fault-detection experiments. IEEE Transactions on Computers 17(8), 792–795 (1968)
Moore, E.F.: Gedanken-experiments on sequential machines. Automata Studies, Annals of Mathematical Studies (34), 129–153 (1956)
Ural, H., Zhang, F.: Reducing the lengths of checking sequences by overlapping. In: Uyar, M.Ü., Duale, A.Y., Fecko, M.A. (eds.) TestCom 2006. LNCS, vol. 3964, pp. 274–288. Springer, Heidelberg (2006)
Ural, H., Wu, X., Zhang, F.: On minimizing the lengths of checking sequences. IEEE Transactions on Computers 46(1), 93–99 (1997)
Yalcin, M.C., Yenigun, H.: Using distinguishing and uio sequences together in a checking sequence. In: Uyar, M.Ü., Duale, A.Y., Fecko, M.A. (eds.) TestCom 2006. LNCS, vol. 3964, pp. 274–288. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Simão, A., Petrenko, A. (2008). Generating Checking Sequences for Partial Reduced Finite State Machines. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds) Testing of Software and Communicating Systems. FATES TestCom 2008 2008. Lecture Notes in Computer Science, vol 5047. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68524-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-68524-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68514-2
Online ISBN: 978-3-540-68524-1
eBook Packages: Computer ScienceComputer Science (R0)