Table 4: Experimental results for different algorithms.

Demand Reference [1] Proposed algorithms
MFN_OBDDMFN_MDDLoop
Collection1Storage (bytes)CPU time (s)LoopNodeStorage (bytes)CPU time (s)NodeStorage (bytes)CPU time (s)

129451,7440.0166366117,3320.024046421,8480.00192817
229451,7440.0166366117,3320.216549431,8920.010049153
329451,7440.0166366117,3321.3385431,8920.032208969
494861,669,5360.26820,0023,51442,1446.64096512,2440.4750734,845
594861,669,5360.26820,0023,51442,14427.7825622,7281.2856020,349

1: collection is the main data structure of the algorithm in [1]. It contains the lower bound of edge state vector, the upper bound of edge state vector, the edge state flow vector, the vector of nonzero state edges, and two constants.