By using minimal-complete-coverage criterion,the test sequence generation based on digraphs can produce more effective test sequences.

This paper put forwards the concepts of totally-ordered no-redundant covering,totally-ordered canonical covering,totally-ordered minimal covering and so on,and also presented the relevant theorems and algorithms for them.

The algorithm guarantees complete coverage by repeating covering portion of the environment and setting the GATE grids.

Using distance transform approach guaranteed complete coverage,and reduced the repeat coverage by setting the gate grids.

The validity of EeRCCA in different network size and node density is verified,simulation results show that EeRCCA can guarantee complete coverage and connectivity and its performance of number of working nodes and coverage ratio is approximately equal to RBSS.

Some applications of complete covering theorem;

From what have been discussed above,the complete covering on universe is constructed based on the new-defined characteristic relation.

In order to keep the data secret reliably, the applicable principle of BSS in noise removal was extended to form a kind of new method for data secrecy based on the strategy of complete covering, by the introduction of virtual observation.

This article is to introduce full covering definition and full covering theorem,and to simplify the provement process of Cauchy Convergence Principle,Accumulation Principle and Finite Covering Principl