Bdd, Binary Decision Diagrams, Software Verification, Model Checking, Boolean Function.
The result is a BDD representing f ∨ g. NOT (Negation): Given a BDD for a Boolean function f, this operation produces a BDD for ¬f. XOR (Exclusive OR): Produces a BDD representing f ⊕ g, which is true when f and g differ. The complexity of performing Boolean operations on BDDs is a significant