A Minimum Coverage Dynamic Adaptive Method for Concurrent Web Service Composition

To address the problems of concurrent Web services composition, this paper applies minimum coverage in logic theory to the semantic matching during the period of service composition, and presents a service composition satisfaction degree model. The least and most appropriate Web services match is obtained dynamically and adaptively by using the model to set the composition satisfaction degree, and the semantic match relation graph of Web services is structured. Based on the above graph and the userpsilas requirement, composition Web services can been gotten directly. This paper describes its the prototype system, and experimental results show that the method can be used to composite concurrent Web service successfully, and the success rate of service composition will increase by setting the appropriate composition satisfaction degree. At the same time, it can improve both the query nicety rate and the composition efficiency.