In this paper we present the generalization of the test sequencing
problem, originally defined for symmetrical tests, that also covers
asymmetrical tests. We prove that the same heuristics that has
been employed in the traditional solution of the problem (e.g.,
the AO* algorithm with heuristics based on Huffman's coding) can be
employed also for the generalized case. Examples are given to
illustrate the approach.