Minimal state space search in parallel production systems

A methodology for transforming the original search space into an equivalent but minimal search space is proposed. First, the concept of dependences leads to a procedure for reduction of the search space. The search procedure using this method can produce a minimal and complete search space. It is shown that this method is applicable to parallel search as well. An added advantage of this method is that it does not exclude the use of heuristics. π-λ transformation is introduced to reduce the parallel search space