Under-approximating Cut Sets for Reachability in Large Scale Automata Networks

Loïc Paulevé, Geoffroy Andrieux, Heinz Koeppl

In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary…