Abstract
A formal model for generating checking sequences for finite state machines is proposed. The model is based on the machine identification problem, which deals with determining the internals of an unknown machine by performing experiments on it. This approach provides a formal framework which can be used to reason about properties of checking sequences in general. Based on this model, a new method called the U γ - methodemploying UIO sequences is developed. The method assumes that the specification machine possesses a compound distinguishing sequence. The U γ -method does not rely on the existence of the reset feature, and constructs checking sequences that can identify all faults of an implementation provided that the implementation has the same number of states as the specification. Empirical results are given to compare the U γ -method with existing methods. These results show that the U γ -method generates shorter checking sequences than existing U-methods for most cases.
This work was supported in part by NSF Grant CCR-9901004.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35497-2_31
Chapter PDF
Similar content being viewed by others
Keywords
References
W. Chen C. Y. Tang S. T. Vuong. Improving the UIOv-method for protocol conformance testing. Computer Communications, 18 (9): 609–619, Sep 1995.
T. S. Chow. Testing software design modeled by finite state machines. IEEE Transactions on Software Engineering, 4 (3): 178–187, May 1978.
A. Dahbura K. Sabnani. A protocol test generation procedure. Computer Networks and ISDN Systems, 15: 285–297, 1988.
S. Fujiwara et al. Test selection based on finite state models. IEEE Transactions on Software Engineering, 17 (6): 591–603, Jun 1991.
G. Gönenç. A method for the design of fault detection experiments. IEEE Transactions on Computers, 19 (6): 551, Jun 1970.
F. C. Hennie. Fault detecting experiments for sequential circuits. Proc. of the 5th Annual Symposium on Switching Circuits Theory and Logical Design, pages 95–110, Nov 1964.
E. P. Hsieh. Checking experiments for sequential machines. IEEE Transactions on Computers, C-20(10): 1152–1166, Oct 1971.
Z. Kohavi. Switching and Finite Automata Theory. McGraw—Hill, 1978.
D. Lee A. V. Aho, A. T. Dahbura and M.U. Uyar. An optimization technique for protocol conformance test generation based on UIO sequences and rural chinese postman tours. IEEE Transactions on Communications, 39 (11): 1604–1615, Nov 1991.
D. Lee M. Yannakis. Testing finite state machines: State identification and verification. IEEE Transactions on Computers, 306–320, 1994.
T. K. Leung D. P. Sidhu. Formal methods for protocol conformance testing: A detailed study. IEEE. Transactions on Software Engineering, pages 413–426, 1989.
E. F. Moore. Gedanken-Experiments on Sequential Machines, in Automata Studies. Princeton University Press, 1956.
B. Serdar. A new approach to checking sequence generation for finite state machines. Master’s thesis, Computer Science Department, North Carolina State University, Available on-line at http://www.lib.ncsu.edu/etd/, 2001.
Y. N. Shen F. Lombardi. Evaluation and improvement of fault coverage of conformance testing by uio sequences. IEEE Transactions on Communications, pages 1288–1293, 1992.
H. Ural A. Rezaki. Construction of checking sequences based on characterization sets. Computer Communications, 18 (12): 911–920, 1995.
M. U. Uyar A. T. Dahbura, K. K. Sabnani. Formal methods for generating protocol conformance test sequences. Proceedings of IEEE, 78 (8): 1347–1325, Aug 1990.
M. Yao A. Petrenko G. Bochmann. Conformance testing of protocol machines without reset. Proceedings of the 13th International Symposium on Protocol Specification, Testing and Verification, pages 241–253, May 25–28 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Serdar, B., Tai, KC. (2002). A New Approach to Checking Sequence Generation for Finite State Machines. In: Schieferdecker, I., König, H., Wolisz, A. (eds) Testing of Communicating Systems XIV. IFIP — The International Federation for Information Processing, vol 82. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35497-2_27
Download citation
DOI: https://doi.org/10.1007/978-0-387-35497-2_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6705-6
Online ISBN: 978-0-387-35497-2
eBook Packages: Springer Book Archive