Abstract
The Unique Input/Output (UIO) sequence has been regarded as an efficient technique for state identification for protocol testing. Unfortunately, it has been shown that some states in a protocol may possess no UIO sequences. Another input/output sequence called a signature can be generated as a substitute for a state without a UIO sequence. The existing signature technique performs state identification by distinguishing a given state from another single state at a time. The limitation is that it cannot assure a minimum-length signature. Moreover, a recently-proposed method, called the Partial UIO (PUIO) sequence, distinguishes a state from a nonempty proper subset of states at a time. The goal of the paper is to construct a minimum-length signature by selecting appropriate PUIO sequences from the set of all PUIO sequences. This paper first transforms the problem into a Minimum-Cost Pattern Covering Problem (MCPCP), where the pattern is the set of the remaining states from which the state under consideration is to be distinguished. To solve the MCPCP, the paper presents a dynamic-programming-based algorithm with three reduction rules and three termination rules. The reduction rules are used to reduce the original problem to simpler subproblems, and the termination rules are used to terminate the reduction process. The paper also discusses the time complexity of the algorithm. Consequently, an optimal-length signature can be efficiently constructed.
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
A. V. Aho, A. T. Dahbura, D. Lee, and M. U. Uyar, “An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours,” Protocol Specification, Testing, and Verification VII, pp. 75–86, 1988.
F. C. Hennie, “Fault Detecting Experiments for Sequential Circuits,” in Proc. Fifth Ann. Symposium Switching Circuit Theory and Logical Design, pp. 95–110, 1964.
R. E. Miller, and S. Paul, “Generating Minimal Length Test Sequences for Conformance Testing of Communication Protocols,” Proc. IEEE INFOCOM ’81, pp. 970–979, 1991.
K. K. Sabnani, and A. T. Dahbura, “A Protocol Test Generation Procedure,” Computer Networks and ISDN Systems, Vol. 15, No. 4, pp. 285–297, 1988.
D. Sidhu, and T. Leung, “Fault Coverage of Protocol Test Methods, ”Proc. IEEE INFOCOM’88, pp. 80–85, 1988.
Wendy Y. L. Chan, Son T. Vuong, and M. Robert Ito, “An Improved Protocol Generation Procedure Based on UIOS,” SIGCOMM’89, pp. 283–294, 1989.
W. H. Chen, and C. Y. Tang, “Computing the Optimal IO Sequence of a Protocol in Polynomial Time,” Information Processing Letters, Vol. 8, No. 40, pp. 145–148, 1991.
W. Chun, and P. D. Amer, “Improvements on UIO sequence generation and partial UIO sequence,” Proc. of Int’l Symposium on Protocol Specification, Testing and Verification, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Lin, R.S., Yuang, M.C. (1995). An Optimal State Identification Method Using a Dynamic-Programming-Based Approach for Protocol Testing. In: Mizuno, T., Higashino, T., Shiratori, N. (eds) Protocol Test Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34883-4_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-34883-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6310-2
Online ISBN: 978-0-387-34883-4
eBook Packages: Springer Book Archive