Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.
Firstly, a classification-tree is constructed based on specification of the test object, and then test cases obtained from the classification-tree are refined by generating a disjunctive normal form.
由软件的形式规格说明构造分类树,再把由分类树方法得到的测试用例转化为析取范式,进一步精炼测试用例。
3
With respect to the principal disjunctive normal form and the principal conjunctive normal form, we also approach the properties of the subscript sets derived from the minimum term and maximum term.