Improving Saturation Efficiency with Implicit Relations

Implicit relations and their derivatives for symbolic state space generation

“…Implicit relations established [8] a static and more efficient alternative for system event representation where events determined the state of any variable as a function of the variable alone.…”

“…An MDD node, p k , is saturated by repeatedly firing the events in G k to add the new next-states to p k until it remains unchanged. The procedures Saturate and RecFire in Figure 5.6 together describe the modified saturation algorithm that uses the generalized implicit relations and only differ from prior saturation algorithms [23,8,9] in operations that require use of transition relations, such as next-state com-putation and recursive call to saturation. Additional procedures, BuildFreeValues and BuildOmega that implement the operations over the constraint parameters, are described in Figure 5.7.…”

“…Implicit relations [8] • Each non-terminal node r is associated with a state variable, denoted by r.var.…”