Bdd, Binary Decision Diagrams, Software Verification, Model Checking, Boolean Function.
f(x₁,x₂,x₃)=(x₁∧x₂∧x₃ )∨(x₁∧¬x₃) Compaction is performed bottom-up, starting with combining leafs with the same Boolean values, continuing to combine isomorphic subtrees, and eliminating nodes whose true and false successors are the same. NOTE: BDDs mostly refer to ROBDD. Boolean Operations on BDDs