Research On Web Services Composition

Web services composition, as a rising field, has been attracting much attention. However,most of composition methods focus on how to produce composition plan firstly, and thenchecking the plan on using efficiency or system cost. All of them run short of the research onwhether the composition plans produced by composition method can be free of dead lock orterminate normally. In respect that web services composition requires composing manycandidate web services, and when the composition plan can not be free of dead lock orterminate normally, and it must bring on great of resource waste and value loss. Therefore,designing a composition method to produce the plan, which can be free of dead lock orterminate normally, contributes great.In this paper, we give a web services composition method, by which the plan produced,can be free of dead lock and terminate normally. Firstly, we propose a web services descriptionmodel, which can describe web services both on syntax and semantic aspect conveniently; andthen we give a group of matching rules, by which we can give each candidate web service anorientation accuratly; basing on the both, we give a web services composition method andprove that the composition plan produced by the method can be free of dead lock andterminate normally; finally, we give an implement of the system and show the system byrunning a classic example, which tesify that the composition plan produced by the system canbe free of dead lock and terminate normally.