A Cost-Effective Planning Graph Approach for Large-Scale Web Service Composition

Algorithm 3

for 𝑠∈𝑆 do

 for 𝑎∈𝐴_𝑖 do

  available(𝑎)←true

  𝑆←𝑆−𝑠

do

 required←inputs(𝑠)

 ns←newsolution

 parent(ns)←𝑠

 for 𝑎∈𝐴_𝑖 do

  if available(𝑎)∧required∩effect(𝑎)≠NULL then

   required←required−(required∩effect(𝑎))

   available(𝑎)←false

   ns←ns∪𝑎

 if required=NULL then

  𝑆←𝑆∪ns

  break

while (required=NULL)

return 𝑆