We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning.
For more efficient solving of goal satisfaction problem we design a novel global filtration technique.