By Topic

Independent Global Constraints Web Service Composition Optimization Based on Color Petri Net

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu Xiangwei ; Econ. & Manage. Dept., Anhui Univ. of Sci. & Technol., Huainan, China ; Xu Zhicai

Under the service-oriented circumstances, developers can rapidly create applications through Web service composition, but the wholly intellectualized automatic composition is a very complicated process. So, many applications and research about composite services emphasize on semi-automatic mode. This paper presents independent global constrains-aware Web service composition method based on color Petri net (CPN) and genetic algorithm (GA). Firstly, a CPN modeling methods which can describe multi-attribute multi-constraint relations and associate relation between component services is proposed. Secondly, combining with the properties of CPN, GA is used to search a legal firing sequence in the CPN model, and the composite service corresponding to the legal firing sequence. Using legal firing sequences of the Petri net makes the service composition locating space based on GA shrink greatly. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition.

Published in:

Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on  (Volume:2 )

Date of Conference:

6-7 June 2009