Paper Info
Title
Test Sequence Construction Using Minimum Information on the Tested System
Abstract
In the paper, approaches to constructing test sequences are considered in the case where only admissible input actions on the system are known, whereas no information about the states of the system or transitions between them in response to these actions is available. Two approaches to constructing test sequences that guarantee the widest variety of situations arising in the course of testing are suggested. The first approach gives rise to the so-called de Bruijn sequences. The second approach yields sequences covering all states or transitions in all finite automata with the number of states not exceeding a given constant. Both kinds of sequences are related to the combinatorial analysis of words in finite alphabets. Some methods for constructing such sequences are also discussed.
Year
DOI
Venue
2005
10.1007/s11086-005-0039-z
Programming and Computer Software
Keywords
Field
DocType
tested system,minimum information,finite automaton,combinatorial analysis,approach yield,finite alphabet,widest variety,admissible input action,test sequence construction,test sequence,de bruijn sequence,finite automata
Discrete mathematics,Algebra,Computer science,Test sequence,Theoretical computer science,Finite-state machine,Complementary sequences,De Bruijn sequence,Combinatorial analysis
Journal
Volume
Issue
ISSN
31
6
1608-3261
Citations 
PageRank 
References 
0
0.34
18
Authors
1
Name
Order
Citations
PageRank
V. V. Kuliamin1676.27