A massive parallel computation in boolean logic

摘要

A code in MasPar MPL for the computation of the prime implicants and all the minimal sums of a Boolean sum-of-product form has been presented. This is an extension to parallel computation of a previously published serial code in C [3] based on the method of consensus taking.