On the number of deadlock tests for closings of block circuits of parity counters

On the basis of the approach suggested by V. N. Sachkov for analysis of asymptotic behaviour of the number of minimal $k$-block coverings of $n$-sets and for finding the limit distribution of the number of blocks in a random minimal covering, the asymptotics of the number of minimal tests checking the block circuits of parity functions for closings is obtained as the test length and the number of blocks in the circuit tend to infinity; the limit distribution of the length of such tests is also found.