Abstract
This paper discusses some developments and results of the theory of test generation from automata. These developments are driven by the needs to better understand the nature of automata testing and thus to make the testing theory more applicable to real systems. We provide an overview of some important results in automata testing recently obtained in the Soviet Union and in the countries that have arisen from it.
Chapter PDF
Similar content being viewed by others
Keywords
References
A. V. Aho, J.E. Hoperoft, J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
G. v. Bochmann and A. Petrenko, Protocol Testing: Review of Methods and Relevance for Software Testing, Proc. of the 1994 Int. Symp. on Software Testing and Analysis (ISSTA), Seattle, Wash., T. Ostrand Ed., pp. 109–124, 1994.
A. M. Bogomolov, A. S. Barashko, I. S. Grunsky, Experiments on Automata. Kiev: Naukova Dumka, 1973 (in Russian).
A. M. Bogomolov, I. S. Grunsky, D. V. Speransky, Checking and Transformation of Discrete Automata. Kiev: Naukova Dumka, 1976 (in Russian).
S. Yu. Boroday, Checking of Single Faults of Finite State Machine Defined by a Fault Function, Kibernetica, no. 6, pp 65–74, 1995.
S. Yu. Boroday, Experiments on Effectively Defined Classes of Automata, Ph.D. Thesis. Saratov University, 1997.
A. Gill, Introduction to the Theory of Finite-State Machines. New York: Mc Graw-Hill, 1962.
S. M. Goberstein, Check Words for the States of Finite Automaton, Kibernetika, no 1, pp. 46–49, 1974.
I. S. Grunsky, Structure of Fragments Uniquely Representing Automata, Intellectual Systems (Moscow), v. 2, pp. 249–258, 1997 (in Russian)
I. S. Grunsky, Checking of Automata Faults Defined with an Explicitly Given Fault Function, Proc. of Institute of Applied Math. and Mechanics, Ukrainian Acad. Of Sci. (Donetsk), vol. 1, pp. 38–43, 1997.
I. S. Grunsky, V. A. Kozlovsky, G. G. Ponomarenko, Finite Automata Representation by Means of Behaviour Fragments. Kiev: Naukova Dumka, 1990 (in Russian).
I. S. Grunsky, I. I. Maximenko, On Experiments on Automata without an Upper Bound on the Number of their States, Dopovidi of Nat. Acad. Of Sci. (Kiev, Ukraine), no. 6, pp. 31–35, 1996.
I. S. Grunsky, A. Petrenko, Design of Checking Experiments on Automata Describing Protocols, Automatika I vychislitelnaya tehnika (Riga), no.4, pp. 714, 1988 (in Russian), Automatic Control and Computer Sciences, Allerton Press, Inc., USA, (in English).
F. C. Hennie, Fault Detecting Experiments for Sequential Circuits, Proc. IEEE 5-th Ann. Symp. On Switch. Circuits Theory and Logical Design, 1964, pp. 95–110.
Z. Kohavi, Switching and Finite Automata Theory. Mc Graw-Hill, 1970.
V. A. Kozlovsky, On the Recognition of an Automaton Relative to a Locally Generated Class, Soviet Math. Dokl, vol. 23, no. 3, pp. 625–628, 1981.
V. A. Kozlovsky, On Representation of the Group Automata, Kibernetika i Sistemny Analiz, no. 2, pp. 21–28, 1996.
V. B. Kudryvtsev, S. V. Aleshin, A. S. Podkolzin, Introduction to Automata Theory, Moscow: Nauka, 1985 (in Russian).
D. Lee, and D. Su, Modelling and Testing of Protocol Systems, Proc. IFIP TC6 10’1 Int. Workshop on Testing of Commun. Syst., Chapman & Hall, Myungchui Kim and Sungwon Kang Eds., pp. 339–364, 1997.
D. Lee, M. Yannakakis, Principles and Methods of Testing Finite State Machines — A Survey, Proc. of the IEEE, vol. 84, no. 8, pp. 1090–1123, Aug. 1996.
B. D. Lukyanov, On Distinguishing and Checking Experiments on Nondeterministic Automata, Kibernetica, no. 5, pp. 69–76, 1995.
B. D. Lukyanov, Deterministic Implementations of Nondeterministic Automata, Kibernetika, no. 4, pp. 34–50, 1996.
E. F. Moore, Gedanken-Experiments on Sequential Machines, Automata Studies, Prinston, NY: Prinston Univ. Press, 1956.
A. Petrenko, G. v. Bochmann, M. Yao, On Fault Coverage of Tests for Finite State Specifications, Computer Networks and ISDN Systems, vol. 29, pp. 81106, 1996.
I. K. Rystsov, A Proof of Accessible Bound of Adaptive Diagnostic Experiment Bound for Finite Automata, Kibernetika, no. 3, pp. 20–22, 1976.
I. K. Rystsov, On Asymptotic Bound of Diagnostic Word Length for Finite Automata, Kibernetika, no. 2, pp. 31–35, 1980.
I. K. Rystsov, An Investigation of Solutions Complexity for Finite Automata Theory Problems. Kandidat Degree dissertation, Kiev: Institute of Cybernetics Ukr. Acad. of Sci., 1980, 121 p.
M. N. Sokolovskii, Diagnostic Experiment with Automata, Kibernetika, no. 6, pp. 44–49, 1971.
B. A. Trakhtenbrot, Y. M. Barzdin, Finite Automata, Behaviour and Synthesis. Amsterdam: North-Holland, 1973.
M. P. Vasilevskii, Failure Diagnosis of Automata, Kibernetika, no. 4, pp. 98108, 1973.
M. Yannakakis, D. Lee, Testing Finite State Machines: Fault Detection, J. of Comput. and Syst. Sci., vol. 50, pp. 209–227, 1995.
A. Petrenko, and N. Yevtushenko, Test Suite Generation for a FSM with a Given Type of Implementation Errors, IFIP Transactions Protocol Specification, Testing, and Verification XII (the Proceedings of IFIP TC6 12th International Symposium on Protocol Specification, Testing, and Verification) 1992, pp. 229–243.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Grunsky, I.S. (1998). Testing of automata: from experiments to representations by means of fragments. In: Petrenko, A., Yevtushenko, N. (eds) Testing of Communicating Systems. IFIP — The International Federation for Information Processing, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35381-4_1
Download citation
DOI: https://doi.org/10.1007/978-0-387-35381-4_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6703-2
Online ISBN: 978-0-387-35381-4
eBook Packages: Springer Book Archive