The Community for Technology Leaders
2013 IEEE International Conference on Services Computing (2008)
July 7, 2008 to July 11, 2008
ISBN: 978-0-7695-3283-7
pp: 367-376
ABSTRACT
WS-BPEL is a standard language to model business processes. Control flow is modeled explicitly using links. Data is passed via shared variables and there is no notion of explicit data links. However, explicit data links are an important means to reason about business process models. We present an algorithm to derive explicit data links in WS-BPEL processes. By considering dead path elimination as defined in WS-BPEL, we reduce the number of derived data links when compared to existing approaches that ignore dead path elimination.
INDEX TERMS
BPEL, DPE, data-flow analysis, data links
CITATION
Rania Khalaf, Frank Leymann, Oliver Kopp, "Deriving Explicit Data Links in WS-BPEL Processes", 2013 IEEE International Conference on Services Computing, vol. 02, no. , pp. 367-376, 2008, doi:10.1109/SCC.2008.122
90 ms
(Ver 3.1 (10032016))