Index-Resilient Zero-Suppressed BDDs: Definition and Operations

摘要: Zero-Suppressed Binary Decision Diagrams (ZDDs) are widely used data structures for representing and handling combination sets Boolean functions. In particular, ZDDs commonly in CAD the synthesis verification of integrated circuits. The purpose this article is to design an error-resilient version structure: a self-repairing ZDD. More precisely, we new ZDD canonical form, called index-resilient reduced ZDD, such that faulty index can be reconstructed time O(k), where k number nodes with corrupted index. Moreover, propose versions standard algorithms manipulation construction error resilient during their execution produce as output. experimental results validate proposed approach.