关键词: 测试点选择, 相关性矩阵, 信息熵, 启发式搜索图

Abstract: Towards decision of the test points for weapon system, this paper researches the dependency matrix and information entropy theory, and translates the problem to the graph searching, so the decision of test points becomes a graph node expanding progress. In order to pilot the graph rearching, a heuristic evaluation function is defined and the methods of expanding for graph nodes are deduced. An example is uesed to validate this method. The application example shows that the method can improve the efficiency of the test point searching and select the points quickly.

Key words: test point selection, dependency matrix, information entropy, heuristic graph search