I.B.Bourdonov, A.S.Kossatchev, V.V.Kuliamin.
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case.
Programming and Computer Software,Vol. 29, No. 5, 2003, pp. 245-258.
14 стр.
pdf, $_€_£_html


Problems of testing program systems modeled by deterministic finite automata are considered. The necessary (and, sometimes, sufficient) component of such testing is a traversal of the graph of the automaton state transitions. The main attention is given to the so-called irredundant traversal algorithms (algorithms for traversing unknown graphs, or on-line algorithms), which do not require an a priori knowledge of the total graph structure.