מרק לסט

The paper focuses on multi-function system testing in the case of multi-stage testing process. In this paper we deal with the problem of covering a digraph of system function clusters by chains (trails) of test cases. The problem is solved by the combinatorial algorithms which include special case algorithms (e.g., tree-like digraph); approximation-based, partitioning-based, and greedy algorithms; and an algorithm based on the maximal matching. Numerical examples illustrate our approach.