Semantic web service composition via model checking techniques Online publication date: Tue, 30-Sep-2014
by Hyunyoung Kil; Wonhong Nam
International Journal of Web and Grid Services (IJWGS), Vol. 9, No. 4, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com