Study on Automatic Web Services Composition Based on Graph
Yanping Yang · Journal of Chinese Computer Systems · 2008
Presented a formal model for Web services composition problem(WSC) and proved that WSC is NP complete.A novel automatic services composition method based on graph called ASC-Graph has been presented in this paper.ASC-Graph consists two phases.The first one is to construct the composition planning graph,by which the satisfiability of composition problem can be justified in polynomial time.The second one is to search the optimal composition solution,where a search algorithms based on heuristic information has been presented.The results of simulation experiments show that ASC-Graph can solve the composition problem of large-scale services effectively.