Optimal Web service composition algorithm based on colored Petri nets

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.