Article in Proceedings INPROC-2008-08

BibliographyMietzner, Ralph; Ma, Zhilei; Leymann, Frank: An Algorithm for the Validation of Executable Completions of an Abstract BPEL Process.
In: Bichler, Martin (ed.); Hess, Thomas (ed.); Krcmar, Helmut (ed.); Lechner, Ulrike (ed.); Matthes, Florian (ed.); Picot, Arnold (ed.); Speitkamp, Benjamin (ed.); Wolf, Petra (ed.): Multikonferenz Wirtschaftsinformatik 2008.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
pp. 437-438, english.
Berlin: GITO-Verlag, February 2008.
Article in Proceedings (Conference Paper).
CorporationMultikonferenz Wirtschaftsinformatik 2008
CR-SchemaD.3.0 (Programming Languages General)
 G.4 (Mathematical Software)
Abstract

Abstract: WS-BPEL is the standard for specifying and executing business processes by orchestrating Web Services. Abstract and executable processes are two kinds of BPEL processes that are defined in the BPEL standard. An abstract process can be used as a process template, which can be completed and made executable through "executable completion". The BPEL standard defines a set of rules that must be obeyed during such an executable completion. In this paper, we present an algorithm for validating whether an executable BPEL process is a valid executable completion of an abstract BPEL process. Our approach advances the existing XML comparison algorithms in a way that it takes the BPEL-specific characteristics into account and is optimized towards the validation of "executable completion" of abstract BPEL processes.

Department(s)University of Stuttgart, Institute of Architecture of Application Systems, Architecture of Application Systems
Entry dateFebruary 29, 2008
   Publ. Computer Science