Abstract
In this paper, we propose a fault model and a method for deriving complete test suites for nondeterministic FSMs with respect to the separability relation. Two FSMs are separable if there exists an input sequence such that the sets of output responses of these FSMs to the sequence do not intersect. In contrast to the well-known reduction and equivalence relations, the separability relation can be checked when the «all weather conditions» assumption does not hold for a nondeterministic Implementation Under Test (IUT). A (complete) test suite derived from the given (nondeterministic) FSM specification using the separability relation can detect every IUT that is separable from the given specification after applying each test case only once. Two algorithms are proposed for complete test derivation without the explicit enumeration of all possible implementations. The first algorithm can be applied when the set of possible implementations is the set of all complete nondeterministic submachines of a given mutation machine. The second algorithm is applied when the upper bound on the number of states of an IUT is known.
Chapter PDF
Similar content being viewed by others
References
Kloosterman, H.: Test derivation from non-deterministic finite state machines. In: Proceedings of the IFIP Fifth International Workshop on Protocol Test Systems, Canada, pp. 297–308 (1992)
Tripathy, P., Naik, K.: Generation of adaptive test cases from nondeterministic Finite State models. IFIP Trans. C: Commun. System C-11, 309–320 (1993)
Luo, G., Petrenko, A., Bochmann, G.v.: Selecting test sequences for partially specified nondeterministic finite state machines. In: Proc. 7th International Workshop on Protocol Test Systems (1994)
Luo, G., Bochmann, G.v., Petrenko, A.: Test selection based on communicating non-deterministic finite-state machines using a generalized Wp-method. IEEE Transactions on Software Engineering 20(2), 149–161 (1994)
Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proc. the 27th ACM Symposium on Theory of Computing, pp. 363–372 (1995)
Petrenko, A., Yevtushenko, N., Bochmann, G.v.: Testing deterministic implementations from their nondeterministic specifications. In: Proc. 9th International Workshop on Protocol Test Systems, pp. 125–140 (1996)
Boroday, S.Y.: Distinguishing Tests for Non-Deterministic Finite State Machines. In: Proc. IFIP TC6 11th International Workshop on Testing of Communicating Systems, pp. 101–107 (1998)
Hierons, R.M.: Adaptive testing of a deterministic implementation against a nondeterministic finite state machine. The Computer Journal 41(5), 349–355 (1998)
Koufareva, I., Evtushenko, N., Petrenko, A.: Design of tests for nondeterministic machines with respect to reduction. Automatic Control and Computer Sciences, USA, vol. 3 (1998)
Hierons, R.M.: Using candidates to test a deterministic implementation against a non-deterministic finite state machine. The Computer Journal 46(3), 307–318 (2003)
Hierons, R.M.: Testing from a non-deterministic finite state machine using adaptive state counting. IEEE Transactions on Computers 53(10), 1330–1342 (2004)
Hierons, R.M., Ural, H.: Concerning the ordering of adaptive test sequences. In: König, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 289–302. Springer, Heidelberg (2003)
Hwang, I., Kim, T., Hong, S., Lee, J.: Test selection for a nondeterministic FSM. Computer Communications 24, 1213–1223 (2001)
Zhang, F., Cheung, T.: Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machines. IEEE Transactions on Software Engineering 29(1), 1–14 (2003)
Petrenko, A., Yevtushenko, N.: Conformance tests as checking experiments for partial nondeterministic FSM. In: Proc. 5th International Workshop on Formal Approaches to Testing of Software (2005)
Miller, R., Chen, D., Lee, D., Hao, R.: Coping with nondeterminism in network protocol testing. In: Proceedings of the 17th IFIP International Conference on Testing of Communicating Systems, USA (2005)
Tanenbaum, A.S.: Computer Networks. Prentice-Hall, NJ (1996)
Petrenko, A., Yevtushenko, N.: Testing from partial deterministic FSM specifications. IEEE Trans. on Computers 54(9), 1154–1165 (2005)
Milner, R. (ed.): A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Spitsyna, N., Trenkaev, V., El-Fakih, K., Yevtushenko, N.: FSM interoperability testing, Wor. In: Progress: 23rd International Conference on Formal Techniques for Networked and Distributed Systems (2003)
Spitsyna, N.: FSM-based test suite derivation strategies for discrete event systems. Ph.D. Thesis, Tomsk State University, pp. 1–158 (2005)
Starke, P.: Abstract automata, pp. 3–419. American Elsevier, New York (1972)
Spitsyna, N., El-Fakih, K., Yevtushenko, N.: Studying the Separability Relation between Finite State Machines. Submitted to Software Testing, Verification and Reliability (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Shabaldina, N., El-Fakih, K., Yevtushenko, N. (2007). Testing Nondeterministic Finite State Machines with Respect to the Separability Relation. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds) Testing of Software and Communicating Systems. FATES TestCom 2007 2007. Lecture Notes in Computer Science, vol 4581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73066-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-73066-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73065-1
Online ISBN: 978-3-540-73066-8
eBook Packages: Computer ScienceComputer Science (R0)