Bdd, Binary Decision Diagrams, Software Verification, Model Checking, Boolean Function.
function ϕ. Shannon Expansion in BDDs Shannon’s expansion theorem is a fundamental principle in Boolean algebra that forms the basis for constructing and manipulating BDDs. The theorem states that any Boolean function f involving a variable x can be expressed as f = (¬x ∧ f [0/x]) ∨ (x ∧ f [1/x])