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

2009 International Conference on Computational Intelligence and Natural Computing Pub Date : 2009-06-06 DOI:10.1109/CINC.2009.73

Li Xiangwei, Xu Zhi-cai

{"title":"Independent Global Constraints Web Service Composition Optimization Based on Color Petri Net","authors":"Li Xiangwei, Xu Zhi-cai","doi":"10.1109/CINC.2009.73","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computational Intelligence and Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINC.2009.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于彩色Petri网的独立全局约束Web服务组合优化

在面向服务的环境下，开发人员可以通过Web服务组合快速创建应用程序，但是完全智能化的自动组合是一个非常复杂的过程。因此，组合服务的许多应用和研究都着重于半自动模式。提出了一种基于彩色Petri网(CPN)和遗传算法(GA)的独立全局约束感知Web服务组合方法。首先，提出了一种能够描述组件服务之间多属性多约束关系和关联关系的CPN建模方法。其次，结合CPN的性质，利用遗传算法在CPN模型中搜索一个合法发射序列，并找到与该合法发射序列相对应的复合服务;使用Petri网的合法发射序列使得基于遗传算法的服务组合定位空间大大缩小。理论分析和实验结果表明，该方法具有较低的计算成本和较高的服务组合成功率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2009 International Conference on Computational Intelligence and Natural Computing

自引率

0.00%

发文量