An Algorithm for Semantic Web Services Composition Based on Output and Input Matching
Existed methods for automatic web services composition based on output and input matching are limited to deal with simple Composition Request (CR) which can only be satisfied by linear composition plan, but complicated CR asks for netty plan because the structure of netty plan can be complicated enough to deal with complicated problem while the structure of linear plan is too simple to do that. In order to overcome the shortcoming of the existed methods, a new algorithm is proposed in this paper which can deal with not only simple CR but also complicated CR. A web services connection matrix is used in the proposed algorithm. This matrix is constructed based on the services which participate in a composition to express all output and input matching relations among services. With this matrix, both simple CR and complicated CR can be processed.
KeywordsLeaf Node Service Composition Service Discovery Prior Service Candidate Service
- 3.L. Freddy, L. Alain and N.S. Ecole, “Semantic Web Service Composition through a Matchmaking of Domain”, European Conference on Web Services (ECOWS’06), 33–242 (2006).Google Scholar
- 4.S.C. oh, B.W. On, E.J Larson and D. Lee, “Web Services Discovery and Composition as graph search problem”, Proceedings of 2005 IEEE International Conference on e-Technology, e-commence and e-servic, 784–786 (2005).Google Scholar
- 5.L. Freddy, L. Alain and N.S. Ecole, “Semantic Web Service Composition Based on a Closed World Assumption”, European Conference on Web Services, (ECOWS’06) 171–180 (2006).Google Scholar
- 7.A. Lerina, C. Gerardo and C. Anna, “An algorithm for Web service discovery through their composition”, Proceedings of the IEEE International Conference on Web Services (ICWS’04), 332–339 (2004).Google Scholar