Abstract
The web service composition problem aims to find an optimal composition of web services to satisfy a given request by using their syntactic and/or semantic features when no single service satisfies it. In particular, the semantics of services helps a composition engine identify more correct, complete and optimal candidates as a solution. In this paper, we study the web service composition problem considering semantic aspects, i.e., exploiting the semantic relationship between parameters of web services. Given a set of web service descriptions, their semantic information and a requirement web service, we find the optimal composition that contains the shortest path of semantically well connected web services which satisfies the requirement. Our techniques are based on semantic matchmaking and three model checking techniques such as Boolean satisfiability solving, symbolic model checking, and abstraction and refinement technique. In the experiment, our proposal efficiently identifies optimal compositions of web services.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
