Bdd, Binary Decision Diagrams, Software Verification, Model Checking, Boolean Function.
expansion and the ‘restrict’ algorithm, exploits the recursive nature of BDDs, and the fact that any BDD can be considered as a tree with a root node representing a Boolean variable and two subtrees representing the function’s behavior when the variable is true or false. The operations use a