Abstract
The paper is devoted to deriving finite test suites with guaranteed fault coverage for Input / Output automata using the ‘black-box’ model when only the upper bound on the number of states of an implementation automaton under test is known but there is no knowledge about its structure. We propose a methods for deriving a finite State Machine (FSM) for a given automaton and show that finite tests derived by the known FSM based test suites without explicit enumeration of implementation automata are complete with respect a number of fault models.
Publisher
Keldysh Institute of Applied Mathematics
Reference16 articles.
1. Hennie, F. C. Fault-Detecting Experiments for Sequential Circuits // Proc. Fifth Ann. Symp. Switching Circuit Theory and Logical Design, 1964. — P. 95-110
2. Василевский, M. П. О распознавании неисправности автоматов // Кибернетика, 1973 (4). — С. 98-108.
3. Bochmann, G., Petrenko A. Protocol testing: review of methods and relevance for software testing // Proc. of International Symposium on Software Testing and Analysis. 1994. — P. 109–123.
4. Dorofeeva, R., El-Fakih, K., Cavalli, A., Maag, S., Yevtushenko, N. FSMbased conformance testing methods: A survey annotated with experimental evaluation // Information & Software Technology, 2010, 52 (12). — P. 1286-1297.
5. Гилл, А. Введение в теорию конечных автоматов // М.: Наука, 1966. — 272 с.