Abstract
The widespread use of finite state machines (FSMs) in modeling of communication protocols has lead to much interest in testing from (deterministic and non-deterministic) FSMs. Most approaches for selecting a test suite from a non-deterministic FSM are based on state counting. Generally, the existing methods of testing from FSMs check that the implementation under test behaves as specified for all input sequences. On the other hand, in many applications, only input sequences of limited length are used. In such cases, the test suite needs only to establish that the IUT produces the specified results in response to input sequences whose length does not exceed an upper bound l. A recent paper devises methods for bounded sequence testing from deterministic FSM specifications. This paper considers the, more general, situation where the specification may be a non-deterministic FSM and extends state counting to the case of bounded sequences. The extension is not trivial and has practical value since the test suite produced may contain only a small fraction of all sequences of length less than or equal to the upper bound.
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
Campeanu, C., Santean, N., Yu, S.: Minimal cover automata for finite languages. Theoretical Computer Science 267, 3–16 (1999)
Chow, T.S.: Testing software design modeled by finite state machines. IEEE Transactions on Software Engineering 4(3), 178–187 (1978)
Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test Selection Based on Finite State Models. IEEE Transactions on Software Engineering 17(6), 591–603 (1991)
Hierons, R.M.: Adaptive testing of a deterministic implementation against a nondeterministic finite state machine. The Computer Journal 41(5), 349–355 (1998)
Hierons, R.M.: Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting. IEEE Transactions on Computers 53(10), 1330–1342 (2004)
Holcombe, M., Ipate, F.: Correct Systems: Building a Business Process Solution. Springer, Berlin (1998)
Ipate, F.: On the Minimality of Finite Automata and Stream X-machines for Finite Languages. The Computer Journal 48(2), 157–167 (2005)
Ipate, F.: Bounded Sequence Test Selection from Finite State Machines (submitted)
Lee, D., Yannakakis, M.: Principles and Methods of Testing Finite State Machines - A Survey. Proceedings of the IEEE 84(8), 1090–1123 (1996)
Luo, G.L., Bochmann, G.v., Petrenko, A.: Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method. IEEE Transactions on Software Engineering 20(2), 149–161 (1994)
Petrenko, A., Yevtushenko, N., Lebedev, A., Das, A.: Nondeterministic state machines in protocol conformance testing. In: Proc. of Protocol Test Systems, VI (C-19), Pau, France, September 28-30, pp. 363–378. Elsevier Science, Amsterdam (1994)
Petrenko, A., Yevtushenko, N., Bochmann, G.v.: Testing deterministic implementations from nondeterministic FSM specifications. In: Proc. of 9th International Workshop on Testing of Communicating Systems (IWTCS 1996), Darmstadt, Germany, September 9-11, pp. 125–140. Chapman and Hall, Boca Raton (1996)
Sidhu, D., Leung, T.: Formal methods for protocol testing: A detailed study. IEEE Transactions on Software Engineering 15(4), 413–426 (1989)
Yevtushenko, N.V., Lebedev, A.V., Petrenko, A.F.: On checking experiments with nondeterministic automata. Automatic Control and Computer Sciences 6, 81–85 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Ipate, F. (2006). Bounded Sequence Testing from Non-deterministic Finite State Machines. In: Uyar, M.Ü., Duale, A.Y., Fecko, M.A. (eds) Testing of Communicating Systems. TestCom 2006. Lecture Notes in Computer Science, vol 3964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11754008_4
Download citation
DOI: https://doi.org/10.1007/11754008_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34184-0
Online ISBN: 978-3-540-34185-7
eBook Packages: Computer ScienceComputer Science (R0)