An algorithm proving the resource-allocation-graph algorithm

By analyzing the resource allocation graph algorithm, we state that the soundess of the algorithm depends on a fact: different simplification sequences of the resource allocation graph lead to a same Non-reducible graph. By analyzing the essence of the resource allocation algorithm, we give another algorithm to verify the resource-allocation-graph algorithm.