A Minimum Coverage Method for Web Service Composition

In order to deal with the complicated service composition situations, i.e., outputs of multi services are combined to semantically contain the input of the subsequent service, we propose a minimum coverage based complex Web service composition method (CWSCM). For more accurate description of the complex Web services, in CWSCM the general semantics of Web services is extended, and the relationship among Web services are discussed. The minimum coverage theory is used to discover desired Web services. The main idea of the paper is to perform the service matching according to the demand objectives. By constructing an optimal ordered service composition graph and describing this graph formally, a new service set can be generated. The preliminary experimental results show that CWSCM can compose complex Web services successfully, and it also can improve the quality and efficiency of service composition.