Circuit designers can efficiently verify designs at the bit and word levels in one graph-based data structure. The authors present the representation technique, manipulation algorithms for K*BMDs, and experimental results other data structures.
No takes yet. Share an insight, caveat, or question.
Drechsler et al. (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: