In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulation. The area-time trade-o that results from di erent minimization techniques of the BDD is discussed. We propose new minimization methods based on dynamic reordering that allow smaller representations with nearly no runtime penalty.