We are looking for an heuristic for the Condition C2 -regarding the visibility of transitions- of Partial Order Reduction Technique :
C2 : If a state "s" is not fully expanded, every transition "alpha" of the set "ample(s)" has to be Invisible.
Is there an article discussing this condition ?
We want to give an heuristic that allow us to fire all Visible transitions but not all the Invisible transitions (to win more in graph reduction).