Article in Proceedings INPROC-2008-27

BibliographyKopp, Oliver; Khalaf, Rania; Leymann, Frank: Deriving Explicit Data Links in WS-BPEL Processes.
In: Proceedings of the International Conference on Services Computing, SCC 2008.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
pp. 367-376, english.
Honolulu, Hawaii, USA: IEEE Computer Society Press, July 2008.
DOI: 10.1109/SCC.2008.122; ISBN: 978-0-7695-3283-7.
Article in Proceedings (Conference Paper).
CR-SchemaD.3 (Programming Languages)
F.3.2 (Semantics of Programming Languages)
KeywordsData-flow Analysis; Reaching Definitions Analysis; def-use edges; data link; BPEL
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.

Full text and
other links
SCC 2008
Contactkopp@iaas.uni-stuttgart.de
Department(s)University of Stuttgart, Institute of Architecture of Application Systems
Project(s)Tools4BPEL
Entry dateApril 21, 2008
   Publ. Institute   Publ. Computer Science