Abstract
This paper addresses the problem of conformance testing of protocols modeled by FSMs with redundant states. Redundant states appear in an FSM which may be nonminimal or nonconnected. The existing test derivation methods usually are not directly applicable to these machines. In this paper, we show that they can be adjusted to cover this class of FSMs and that the traditional assumption on the minimality of machines is not necessary. Another problem with redundant states is that they can cause the appearance of additional states in protocol implementations whose guaranteed detection requires tests of an exponential length. This paper proposes techniques for deriving tests for FSMs with redundant or additional states such that a high fault coverage is achieved while maintaining an acceptable test suite length. The effectiveness of the proposed methods has been evaluated in an experimental way using a benchmark protocol.
Chapter PDF
Similar content being viewed by others
References
G. v. Bochmann and A. Petrenko, “Protocol Testing: Review of Methods and Relevance for Software Testing”, ISSTA’94, ACM International Symposium on Software Testing and Analysis, Seattle, U.S.A., 1994, pp. 109–124.
G. v. Bochmann, A. Petrenko, and M. Yao, “Fault Coverage of Tests Based on Finite State Models”, the Proceedings of IFIP TC6 Seventh International Workshop on Protocol Test Systems, 1994, Japan.
T. S. Chow, “Test Design Modeled by Finite-State Machines”, IEEE Trans., SE-4, No. 3, 1978, pp. 178–187.
S. Fujiwara, G. v. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi, “Test Selection Based on Finite State Models”, IEEE Trans., SE-17, No. 6, 1991, pp. 591–603.
A. Gill, Introduction to the Theory of Finite-State Machines, NY, McGraw-Hill, 1962, 207 p.
F. C. Hennie, “Fault Detecting Experiments for Sequential Circuits”, IEEE 5th Ann. Symp. on Switching Circuits Theory and Logical Design, 1964, pp. 95–110.
D. Hogrefe, “OSI Formal Specification Case Study: The Inres Protocol and Service”, University of Berne, Technical Report, 1991.
J. E. Hoperoft, “An n log n Algorithm for Minimizing States in a Finite Automaton”, Theory of Machines and Computations, NY, Academic Press, 1971, pp. 189–196.
J. E. Hoperoft, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979, 418 p.
Z. Kohavi, Switching and Finite Automata Theory, NY, McGraw-Hill, 1978.
D. Lee and M. Yannakakis, “Testing Finite-State Machines: State Identification and Verification”, IEEE Trans. on Computers, Vol. 43, No. 3, 1994, pp. 306–320.
G. Luo, A. Petrenko, and G. v. Bochmann, “Test Selection based on Communicating Nondeterministic Finite State Machines using a Generalized Wp-Method”, IEEE Trans., Vol. SE-20, No. 2, 1994, pp. 149–162.
G. Luo, A. Petrenko, and G. v. Bochmann, “Selecting Test Sequences for Partially-Specified Nondeterministic Finite State Machines”, the Proceedings of IFIP TC6 Seventh International Workshop on Protocol Test Systems, 1994, Japan.
E. F. Moore, “Gedanken-Experiments on Sequential Machines”, Automata Studies, Princeton University Press, Princeton, NJ, 1956.
A. Petrenko, G. v. Bochmann, and R. Dssouli, “Conformance Relations and Test Derivation”, IFIP Transactions, Protocol Test Systems, VI, (the Proceedings of IFIP TC6 Fifth International Workshop on Protocol Test Systems, 1993), Ed. by O. Rafiq, 1994, North-Holland, pp. 157–178.
A. Petrenko, “Checking Experiments with Protocol Machines”, IFIP Transactions, Protocol Test Systems, IV (the Proceedings of IFIP TC6 Fourth International Workshop on Protocol Test Systems, 1991), Ed. by Jan Kroon, Rudolf J. Heijink and Ed Brinksma, 1992, North-Holland, pp. 83–94.
A. Petrenko, N. Yevtushenko, and G. v. Bochmann, “Experiments on Nondeterministic Systems for the Reduction Relation”, Universite de Montreal, DIRO, Technical Report #932, 1994, 23p (submitted for publication).
A. Petrenko, N. Yevtushenko, A. Lebedev, and A. Das, “Nondeterministic State Machines in Protocol Conformance Testing”, IFIP Transactions, Protocol Test Systems, VI, (the Proceedings of IFIP TC6 Fifth International Workshop on Protocol Test Systems, 1993), Ed. by O. Rafiq, 1994, North-Holland, pp. 363–378.
D. P. Sidhu and T. K. Leung, “Formal Methods for Protocol Testing: A Detailed Study”, IEEE Trans. Vol. SE-15, No. 4, 1989, pp. 413–425.
H. Ural, “Formal Methods for Test Sequence Generation”, Computer Comm., Vol. 15, No. 5, 1992, pp. 311–325.
M. P. Vasilevski, “Failure Diagnosis of Automata”, Cybernetics, Plenum Publishing Corporation, NY, No. 4, 1973, pp. 653–665.
S. T. Vuong, W. W. L. Chan, and M. R. Ito, “The UIOv-method for Protocol Test Sequence Generation”, Proceedings of IFIP TC6 Second International Workshop on Protocol Test Systems, 1989, Ed. by J. de Meer, L. Machen and W. Effelsberg, North-Holland, pp. 161–175.
M. Yannakakis, D. Lee, “Testing Finite State Machines”, Proceedings of the 23d Annual ACM Symposium on Theory of Computing, Louisiana, 1991, pp. 476–485.
M. Yao, A. Petrenko and G. v. Bochmann, “Conformance Testing of Protocol Machines without Reset”, IFIP Transactions, Proceedings of the IFIP 13th Symposium on Protocol Specification, Testing and Verification, Ed. by A. Danthine, G. Leduc and P. Wolper, 1993, North-Holland, pp. 241–253.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Petrenko, A., Higashino, T., Kaji, T. (1996). Handling redundant and additional states in protocol testing. In: Cavalli, A., Budkowski, S. (eds) Protocol Test Systems VIII. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34988-6_19
Download citation
DOI: https://doi.org/10.1007/978-0-387-34988-6_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6312-6
Online ISBN: 978-0-387-34988-6
eBook Packages: Springer Book Archive