The algorithm checks if the network 440 satisfies the formula 450 by constructing, in an on-the-fly fashion, a dependency graph whose nodes are of the form <s,X> 460 where s is a state of the given network 440 and X is a subformula of the given formula 450.