Abstract
Web service is a software system designed to support interoperable machine-to-machine interaction over a network. 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 two formal verification techniques such as boolean satisfiability solving and symbolic model checking. In a preliminary experiment, our proposal efficiently identify optimal compositions of web services.
Corresponding author: Wonhong Nam. This research was supported by the MKE(Ministry of Knowledge Economy), Korea, under the ITRC(Information Technology Research Center) support program supervised by the NIPA(National IT Industry Promotion Agency): NIPA-2012-H0301-12-3006.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang, L., Malik, S.: The Quest for Efficient Boolean Satisfiability Solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 17–36. Springer, Heidelberg (2002)
The Cadence SMV model checker, http://www.kenmcmil.com/smv.html
Kona, S., Bansal, A., Blake, B., Bleul, S., Weise, T.: WSC-2009: a quality of service-oriented web services challenge. In: The 11th IEEE Conference on Commerce and Enterprise Computing, pp. 487–490 (2009)
Martin, D.: OWL-S: Semantic Markup for Web Services (2004), http://www.w3.org/Submission/OWL-S
Fensel, D., Kifer, M., de Bruijn, J., Domingue, J.: Web Service Modeling Ontology (WSMO). W3C member submission (2005)
Russell, S., Norvig, P.: Artificial Intelligence: a modern approach. Prentice-Hall (1995)
Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K.: Semantic Matching of Web Services Capabilities. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 333–347. Springer, Heidelberg (2002)
Zhang, R., Arpinar, I.B., Aleman-Meza, B.: Automatic composition of semantic web services. In: Proceedings of the 10th International Conference on Web Services, pp. 38–41 (2003)
Sirin, E., Parsia, B., Hendler, J.A.: Filtering and selecting semantic web services with interactive composition techniques. IEEE Intelligent Systems 19(4), 42–49 (2004)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)
Clarke, E., Grumberg, O., Peled., D.: Model checking. MIT Press (2000)
Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided Abstraction Refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kil, H., Nam, W. (2012). Semantic Web Service Composition Using Formal Verification Techniques. In: Kim, Th., Ma, J., Fang, Wc., Zhang, Y., Cuzzocrea, A. (eds) Computer Applications for Database, Education, and Ubiquitous Computing. EL DTA 2012 2012. Communications in Computer and Information Science, vol 352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35603-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-35603-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35602-5
Online ISBN: 978-3-642-35603-2
eBook Packages: Computer ScienceComputer Science (R0)