Abstract
Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set \(E_{\alpha^{\prime}}\) of α ′–sequences and a set E T of T–sequences, that both recognize the states, and elements of E C which represents the transitions in the FSM. An optimization algorithm may then be used to produce a reduced length checking sequence by connecting the elements of \(E_{\alpha^{\prime}}\), E T , and E C using transitions taken from an acyclic set E ′′. It is known that only a subset E′ C of E C is sufficient to form a checking sequence. This paper improves this result by reducing the number of elements in E′ C that must be included in the generated checking sequence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tanenbaum, A.S.: Computer Networks, 3rd edn. Prentice Hall International Editions, Englewood Cliffs (1996)
Gill, A.: Introduction to the Theory of Finite–State Machines. McGraw-Hill, New York (1962)
Hennie, F.C.: Fault–detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, pp. 95–110 (1964)
Sabnani, K., Dahbura, A.: A protocol test generation procedure. Computer Networks 15, 285–297 (1988)
Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill, New York (1978)
Lee, D., Yannakakis, M.: Testing finite state machines: state identification and verification. IEEE Trans. Computers 43, 306–320 (1994)
Gonenc, G.: A method for the design of fault detection experiments. IEEE Transactions on Computers 19, 551–558 (1970)
Ural, H., Wu, X., Zhang, F.: On minimizing the lengths of checking sequences. IEEE Transactions on Computers 46, 93–99 (1997)
Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Transactions on Computers 51, 1111–1117 (2002)
Chen, J., Hierons, R., 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)
Lee, D., Yannakakis, M.: Principles and methods of testing finite–state machines – a survey. Proceedings of the IEEE 84, 1089–1123 (1996)
Miller, R.E., Paul, S.: On the generation of minimal–length conformance tests for communication protocols. IEEE/ACM Transactions on Networking 1, 116–129 (1993)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)
Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference. In: Proceedings of Fifth ACM-SIAM Symposium on Discrete Algorithms, pp. 344–354 (1994)
Fujito, T.: A note on approximation of the vertex cover and feedback vertex set problems. Information Processing Letters 59, 59–63 (1996)
Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Transactions on Computers (2004) (submitted)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tekle, K.T., Ural, H., Yalcin, M.C., Yenigun, H. (2005). Generalizing Redundancy Elimination in Checking Sequences. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_93
Download citation
DOI: https://doi.org/10.1007/11569596_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29414-6
Online ISBN: 978-3-540-32085-2
eBook Packages: Computer ScienceComputer Science (R0)