Symbolic simulation using decision diagrams

If decision diagrams (DDs) are used to represent the logical behaviour of a combinational logic circuit, then the representation is usually constructed by a traversal in topological order. At each gate the corresponding synthesis operation is carried out. This traversal process is called symbolic simulation. Obviously the sequence in which the operations are performed at each gate influences the number of nodes needed during computation. The authors consider different traversal strategies for OBDDs and OMDDs. The strategies are compared by means of experiments