Integrating CSP decomposition techniques and BDDs for compiling configuration problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
The core computation in BDD-based symbolic synthesis and verificationis forming the image and pre-image of sets of states under the transitionrelation characterizing the sequential behavior of the design. Computingan image or a pre-image consists of ordering the latch transition relations,clustering them and eventually re-ordering the clusters. Existingalgorithms are mainly limited by memory resources. To make them efficient as possible, we address a set of heuristics with the main targetof minimizing the memory used during image computation. They includea dynamic heuristic to order the latch relations, a dynamic framework cluster them, and the application of conjunctive partitioning during imagecomputation. We provide and integrate a set of algorithms and we reportreferences and comparisons with recent work. Experimental results aregiven to demonstrate the efficiency and robustness of the approach.