Abstract
Web service composition provides an open, standards-based approach for connecting web services together to create higher-level business processes. The Standards are designed to reduce the complexity required to compose web services, hence reducing time and costs, and increase overall efficiency in businesses. This paper present independent global constrains web service composition optimization methods based on Discrete Particle Swarm Optimization (DPSO) and associate Petri net (APN). Combining with the properties of APN, an efficient DPSO algorithm is presented which is used to search a legal firing sequence in the APN model. Using legal firing sequences of the Petri net makes the service composition locating space based on DPSO shrink greatly. Finally, for comparing our methods with the approximating methods, the simulation experiment is given out. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition.
This is a preview of subscription content, log in via an institution to check access.
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
Rao, J., Küngas, P., Matskin, M.: Logic-based Web services composition: from service description to process model. In: Proceedings of the 2004 International Conference on Web Services, San Diego, USA (2004)
Wu, D., Sirin, E., Hendler, J., Nau, D., Parsia, B.: Automatic Web services composition using SHOP2. In: Workshop on Planning for Web Services, Trenton, Italy (2003)
Gooneratne, N., Tari, Z., Harland, J.: Matching Strictly Dependent Global Constraints for Composite Web Services. In: Proceedings of the European Conference on Web Services, pp. 139–148 (2007)
Ardagna, D., Pernici, B.: Adaptive Service Composition in Flexible Processes. IEEE Transaction on Software Engineering 33(6), 369–384 (2007)
Gooneratne, N., Tari, Z.: Matching Independent Global Constraints for Composite Web Services. In: WWW 2008, pp. 765–774 (2008)
Sirin, E., Parsia, B.: Planning for Semantic Web Services. In: Proceedings of International Semantic Web Conference, Workshop on Semantic Web Services. IEEE Press, Los Alamitos (2004)
Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. Part I:background and development. Natural Computing: an international journal 6(4), 467–484 (2007)
Shih, D.-H., Chiang, H.-S., Lin, B.: A Generalized Associative Petri Net for Reasoning. Transactions Knowledge and Data Engineering 19(9), 1241–1251 (2007)
Jiang, C.: A Polynomial-time Algorithm for the Legal Firing sequences Problem of a Type of Synchronous Composition Petri net. Science in China (series E) 22(1), 116–124 (2002)
Fang, X., Jiang, C., Fan, X.: Independent Global Constraints-Aware Web Service Composition Optimization. Information Technology Journal 8(2), 181–187 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, X., Fan, X., Yin, Z. (2009). Constraint Web Service Composition Based on Discrete Particle Swarm Optimization. In: Liu, W., Luo, X., Wang, F.L., Lei, J. (eds) Web Information Systems and Mining. WISM 2009. Lecture Notes in Computer Science, vol 5854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05250-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-05250-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05249-1
Online ISBN: 978-3-642-05250-7
eBook Packages: Computer ScienceComputer Science (R0)