基于着色Petri网的最小代价服务合成方法

Journal of Systems Engineering and Electronics ›› 2010, Vol. 32 ›› Issue (2): 415-418.

基于着色Petri网的最小代价服务合成方法

李小艳1，张晓松2，方敏1

（1. 西安电子科技大学计算机学院，陕西西安 710071; 
2. 西安公路研究院交通工程研究所，陕西西安 710054）

出版日期:2010-02-03 发布日期:2010-01-03

Optimal Web service composition algorithm based on colored Petri nets

LI Xiao-yan1, ZHANG Xiao-song2, FANG Min1

(1. School of Computer Science & Technology, Xidian Univ., Xi’an 710071, China;
2. Transportation Engineering Inst., Xi’an Highway Scientific Academy, Xi’an 710054, China)

Online:2010-02-03 Published:2010-01-03

摘要/Abstract

摘要：

如何动态地把现存的各种Web服务整合起来以形成新的、满足不同用户需求的服务已成为新的应用需求和研究热点.针对现有服务合成中服务选择技术的不足,提出了一种基于着色Petri网的最小代价服务合成方法。该方法主要思想是根据候选服务输入输出之间的逻辑关系建立有色Petri网,从而找出所有合成方案,然后根据原子服务的服务质量(quality of service, QOS)参数选择具有最小代价的合成方案,通过服务实例验证，基于着色Petri网服务合成方法能够获得最小代价的组合方式。

Abstract:

Recently, people intend to integrate the existent Web services to form a new service that can meet the needs of different users. How to do it dynamically is a hot research area. An optimal web service composition algorithm based on colored petrinets is proposed. The essence of the algorithm is that of ours, on the basis of the input and output logical relation of candidate Web services, the colored petrinets is constructed in order to find all the integration methods. From those methods, the optimal one is selected by using the QoS attributes of the Proto Web service. The effectiveness of the algorithm based on colored petri nets is verified by an example.

李小艳1，张晓松2，方敏1. 基于着色Petri网的最小代价服务合成方法[J]. Journal of Systems Engineering and Electronics, 2010, 32(2): 415-418.

LI Xiao-yan1, ZHANG Xiao-song2, FANG Min1. Optimal Web service composition algorithm based on colored Petri nets[J]. Journal of Systems Engineering and Electronics, 2010, 32(2): 415-418.