DocumentCode :
2455370
Title :
The Algorithm of Sub-process Discovery for BPEL Process Based on Variable Dependence
Author :
Min, Deng ; Na, Deng ; Yong, Peng ; Bo, Cheng
Author_Institution :
State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing, China
Volume :
1
fYear :
2010
fDate :
12-14 April 2010
Firstpage :
559
Lastpage :
563
Abstract :
The Web Services Business Process Language (BPEL) is widely used in service composition and orchestration, but sometimes it is time consuming and unnecessary to construct a BPEL process from scratch. It absolutely has the need to seek a way to realize the reuse of BPEL sub-processes. This paper advances an algorithm to solve this problem based on mapping process to a multi-tree and variable dependence. At the end of this paper, a BPEL process instance proves this algorithm´s validity.
Keywords :
Web services; set theory; specification languages; trees (mathematics); BPEL process; Web services business process language; mapping process; multitree; service composition; service orchestration; subprocess discovery algorithm; variable dependence; Business communication; Communication switching; Computer networks; Laboratories; Mobile communication; Mobile computing; Service oriented architecture; Telecommunication computing; Telecommunication switching; Web services; BPEL; sub-process; variable dependence;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Mobile Computing (CMC), 2010 International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-4244-6327-5
Electronic_ISBN :
978-1-4244-6328-2
Type :
conf
DOI :
10.1109/CMC.2010.271
Filename :
5471414
Link To Document :
بازگشت