1. In this problem you are going to write some C/C++ code to implement the basic functionality of a BDD-based symbolic model checker. You will use the CUDD BDD package
([login to view URL]~fabio/CUDD/).
Given the variable ordering x1 < x2 < x3:
(a) Construct the BDDs for the formulas (x1 ∧ x2) ∨ x3 and ¬x1 ∧ x3.
(b) Using the BDDs from part (a) show the recursive calls for the apply algorithm while
Computing the conjunction of the above two formulas. Show the resulting BDD.
HI
I am quite good in C/C++ programming but I will have to get accustomed with CU Decision Diagram Package which might take a couple of days. Once i have understood the library coding won't take more than a day. Looking forward to hear from you.
Regards