BDD-based model checking
Iterative, fixed-point algorithms that are quite similar to those in explicit model checking
Applying boolean functions to BDDs is efficient, which makes the underlying algorithms efficient
- ? becomes set intersection, ? becomes set union, etc.
When the BDDs remain small, that is
- Variable ordering is a key issue