A graph-based approach to Web services composition

Automatic composition of Web services has drawn a great deal of attention recently. By composition, we mean taking advantage of currently existing Web services to provide a new service that does not exist on its own. Therefore, in order to have a more complex service, we can use some semantically related simpler Web services and execute them in such a way that the whole set provides the desired service. There are Web service specification languages that specify semantic properties of Web services. These languages are helpful in searching for those Web services that can participate in a composition. This work is aimed at searching among Web services in order to find those whose composition provides a specific behavior. Those Web services found after this search are incrementally composed together to build a new service that realizes that behavior. Our technique takes advantage of graph structures and also a particular formalism called interface automata.