Abstract
Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the process of electronic design automation. Due to limitations of the descriptive power of OBDDs more general models of Binary Decision Diagrams have been studied. In this paper, POBDDs as a true extension of the OBDD data structure are addressed. As for OBDDs, the most important factor influencing the representation size of POBDDs is the chosen order of the input variables. Adaptive variable reordering heuristics as sifting for OBDDs can be adapted to POBDDs, while some important restrictions arise from the property of being a non canonical data structure. The viability and the efficiency of the adapted sifting algorithm for POBDDs is shown by symbolic simulation of standard benchmarks.
Users
Please
log in to take part in the discussion (add own reviews or comments).