Minimal Spanning Tree-based Automatic Sequencing for Communication Protocol Consistency Test
In view of the problem of large occupation and sub-satisfactory utility in the currently prevailing test sequencing methods,this essay proposes a method based on the minimal spanning tree algorithm.The method establishes the distri-bution network communication protocol extension finite state automata model to describe and simulate the dynamic behav-ior.Then it performs model solution based on the minimal spanning tree,and obtaining sub-sequences by iterating the state change of the communication protocol.Finally the UIO-validated sub-sequences was integrated and the automatic se-quencing for distribution network communication protocol test was achieved.The experimental results proved that the pro-posed method could acquire the sequence data with relatively small occupations of 7～8 bits,which facilitates satisfying the demand of consistency test of distribution network communication protocol.
万方数据
维普
