Complexity of tests of activity for partial Boolean functions

The notion of an activity tests for partial Boolean functions is introduced. Asymptotical estimates are obtained for complexity of minimal activity tests. The complexity of a minimal complete test is shown never to exceed the number of variables in a partial Boolean function.