DocumentCode :
509222
Title :
CPN-based Web Service Composition Technology
Author :
Lianzhang, Zhu ; Chengchang, Ren
Author_Institution :
Coll. of Comput. & Commun. Engnering, China Univ. of Pet., Dongying, China
Volume :
3
fYear :
2009
fDate :
26-27 Dec. 2009
Firstpage :
114
Lastpage :
116
Abstract :
In many cases, a single Web service can´t meet the needs of users, so Web service composition becomes an important issue. As the Web service increases rapidly, it is more and more important to find an auto composition technology. At present most CPN-based composition technologies establish CPN model, but these methods don´t take full advantage of CPN tools to resolve the composition. In this paper, we firstly give the CPN model of the whole of the Web services according to the match of service interface. In our model, a transition represents an operation and a place represents an input or an output. Every input and output isn´t semantically ambiguous by ontology. Every places´ colorset is bool. Secondly, we calculate the state space of the CPN model. Thirdly, we use node functions of the state space in CPN tools to find the target nodes each of which make every target place have a true value. Then a path must be figured out from the initial node to the target node by CPN Tools arc functions. The Web service sequence represented by this path is the composition service.
Keywords :
Petri nets; Web services; ontologies (artificial intelligence); Web service composition; autocomposition technology; colored Petri net; ontology; Educational institutions; Industrial engineering; Information management; Innovation management; Ontologies; Organizing; Paper technology; Petroleum; State-space methods; Web services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Management, Innovation Management and Industrial Engineering, 2009 International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-0-7695-3876-1
Type :
conf
DOI :
10.1109/ICIII.2009.337
Filename :
5369739
Link To Document :
بازگشت