Reversibility Labeling Algorithm
LabelSystem(initial state ?, compiled system S’)
For each state variable y of S’ in decreasing topological order:
For each transition ?y of y, label ?y Allowed if all its state conditions are labeled Reversible.
Compute the strongly connected components (SCCs) of the Allowed transitions of y.
Find y’s initial value y = ei in ?. Label each assignment in the SCC of y = ei as Reversible.