Robert M. Hierons
ABSTRACT
A number of methods have been published to construct checking sequences for testing from Finite State Machine-based specifications. Many of these methods require the existence of a preset distinguishing sequence in the model. In this paper, we show that usually an adaptive distinguishing sequence is sufficient for these methods to work. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones.
- Gill, A. Introduction to the Theory of Finite-State Machines, McGraw-Hill, NewYork, 1962.Google Scholar
- Hennie, F. C. Fault detecting experiments for sequential circuits. Proc. 5th. Symp. Switching Circuit Theory and Logical Design, Princeton, N.J., 1964, 95--110.Google Scholar
- Lee, D., Yannakakis, M. Testing finite state machines: state identification and verification. IEEE Trans. on Computers, 43 (1994), 306--320. Google ScholarDigital Library
- Chow, T. Testing software design modeled by finite-state machines. IEEE Trans. on Software Eng. SE-4, (1978), 178--187. Google ScholarDigital Library
- Fujiwara, S., Bochmann, Gv., Khendek, F., Amalou, M., Ghedamsi, A. Test selection based on finite state models. IEEE Trans. on Software Eng. 17, 6 (1991), 591--603. Google ScholarDigital Library
- Sabnani, K. K., Dahbura, A. T. A protocol test generation procedure. Computer Networks 15, 4 (1988), 285--297. Google ScholarDigital Library
- Dahbura, A. T., Sabnani K. K., Uyar, M. U. Formal methods for generating protocol conformance test sequences. Proceedings of the IEEE, 78 (1990), 1317--1325.Google ScholarCross Ref
- Lee, D., Yannakakis, M. Principles and methods of testing finite state machines -- a survey. Proceedings of the IEEE, 84, 8 (1996), 1089--1123.Google ScholarCross Ref
- Ural, H., Wu, X., Zhang, F. On minimizing the length of checking sequence. IEEE Trans. on Computers, 46 (1997), 93--99. Google ScholarDigital Library
- Hierons, R. M., Ural, H. Reduced length checking sequences. IEEE Trans. On Computers, 51, 9 (2002), 1111--1117. Google ScholarDigital Library
- Chen, J., Hierons, R. M., Ural, H., Yenigun, H. Eliminating redundant tests in checking sequences. In Proc. of IFIP TestCom'05, Montreal, Quebec, 2005, 146--158. Google ScholarDigital Library
- Tekle, K. T., Ural, H., Yalcin, C. M., Yenigun, H. Generalizing redundancy elimination in checking sequences. Proc. of ISCIS'05, Istanbul, Turkey, 2005, 915--926. Google ScholarDigital Library
- Hierons, R. M., Ural, H. Optimizing the length of checking sequences. IEEE Trans. on Computers, 55, 5 (2006), 618--629. Google ScholarDigital Library
- Gonenc, G. A method for the design of fault detection experiments. IEEE Trans. on Computers, 19 (June 1970), 551--558. Google ScholarDigital Library
- Sokolovskii, M. N. Diagnostic experiments with automata. Kibernetika, 6 (1971), 44--49.Google Scholar
Index Terms
- Using adaptive distinguishing sequences in checking sequence constructions
Recommendations
Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences
SEFM '09: Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal MethodsMethods for testing from Finite State Machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these ...
Lower bounds on lengths of checking sequences
AbstractLower bounds on the lengths of checking sequences constructed for testing from Finite State Machine-based specifications are established. These bounds consider the case where a distinguishing sequence is used in forming state recognition and ...
Using distinguishing and UIO sequences together in a checking sequence
TestCom'06: Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating SystemsIf a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence $\bar{D}$ , then there are methods that make ...
Comments