Minimal implicant and dnf representation 極小蘊涵和析取范式表示
After then , a new method of solving the minimal cuts of s - coherent tree based on bdd and prime number was given in the qualitative analysis of fta based on bdd , the prime implicant sets of non s - coherent tree was calculated by an iterative method 再次,在基于bdd的故障樹定性分析研究中,提出并實現(xiàn)了基于bdd和素數(shù)法相結(jié)合的單調(diào)關(guān)聯(lián)故障樹最小割集求解的新方法,用迭代法實現(xiàn)了非單調(diào)關(guān)聯(lián)故障樹質(zhì)蘊含的求解。
In Boolean logic, an implicant is a "covering" (sum term or product term) of one or more minterms in a sum of products (or maxterms in a product of sums) of a boolean function. Formally, a product term P in a sum of products is an implicant of the Boolean function F if P implies F.