ACM Home Page
Please provide us with feedback. Feedback
Independent global constraints for web service composition based on GA and APN
Full text PdfPdf (566 KB)
Source
ACM/SIGEVO Summit on Genetic and Evolutionary Computation archive
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation table of contents
Shanghai, China
SESSION: Full papers table of contents
Pages 119-126  
Year of Publication: 2009
ISBN:978-1-60558-326-6
Authors
Xianwen Fang  Key Lab of Embedded System & Service Computing Ministry of Education, Tongji University, Shanghai, China
Changjun Jiang  Key Lab of Embedded System & Service Computing Ministry of Education, Tongji University, Shanghai, China
Xiaoqin Fan  Key Lab of Embedded System & Service Computing Ministry of Education, Tongji University, Shanghai, China
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 53,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1543834.1543852
What is a DOI?

ABSTRACT

The Service composition has been a popular research presently. Service Composition by manual cannot meet the expectations in reality, but the wholly intellectualized automatic service composition is a very complicated process. So, many applications and research about service composition are oriented to semi-automatic service composition, for obtaining optimal performance by some compositing policies.

A global constraint is independent if the values that should be assigned to all the remaining restricted attributes can not be uniquely determined once a value is assigned to one. Based on the Web service ontology, the paper presents an independent global constrains-aware Web service composition approach based on semantic. Associate Petri net (APN) modeling methods which can describe multi-attribute multi-constraint relations and associate relationships between component services are proposed. Then, using the properties and reasoning rules of APN, a constraint-aware service composition optimization algorithm is presented in order to locate legal firing sequences in APN model, and those corresponding to the legal firing sequences with the biggest trust value are the optimal solutions. Lots of experiments show that this semantic-based method has both lower time consuming and higher success ratio of service composition.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
CHEN Dingjian. A study about Web service discovery and composition based on semantic Web, Northwest industry university PHD thesis, 2006(in Chinese)
2
 
3
 
4
 
5
6
 
7
 
8
SUN Ping, JIANG Changjun. Using Service Clustering to Facilitate Process-Oriented Semantic Web Service Discovery, Chinese Journal of Computer, VOL 31(8):1340--1353, 2008(in Chinese)
 
9
T. Murata. Petri nets -- properties, analysis, and applications {J} Proc. IEEE, Vol.77, No.11, pp.541--580, 1989
 
10
HAO Dong, JIANG Changjun, LIN Lin. Petri Net Based Modeling and GA Based Scheduling for FMS, Chinese Journal of Computer, VOL 28(2):202--208, 2005(in Chinese)
 
11
JIANG Changjun. A Polynomial-time Algorithm for the Legal Firing sequences Problem of a Type of Synchronous Composition Petri net, Science in China (series E), VOL 22(1):116--124, 2002
 
12
E. Sirin and B. Parsia. Planning for Semantic Web Services. In Proceedings of International Semantic Web Conference, Workshop on Semantic Web Services, November 2004.

Collaborative Colleagues:
Xianwen Fang: colleagues
Changjun Jiang: colleagues
Xiaoqin Fan: colleagues