If decision diagrams (DDs) are used to represent the logical behaviour
of a combination logic circuit, then the representation is usually co
nstructed by a traversal in topological order. At each gate the corres
ponding synthesis operation is carried out. This traversal process is
called symbolic simulation. Obviously the sequence in which the operat
ions are performed at each gate influences the number of nodes needed
during computation. The authors consider different traversal strategie
s for OBDDs and OMDDs. The strategies are compared by means of experim
ents.