Artikel in Tagungsband INPROC-2008-08

Bibliograph.
Daten
Mietzner, Ralph; Ma, Zhilei; Leymann, Frank: An Algorithm for the Validation of Executable Completions of an Abstract BPEL Process.
In: Bichler, Martin (Hrsg); Hess, Thomas (Hrsg); Krcmar, Helmut (Hrsg); Lechner, Ulrike (Hrsg); Matthes, Florian (Hrsg); Picot, Arnold (Hrsg); Speitkamp, Benjamin (Hrsg); Wolf, Petra (Hrsg): Multikonferenz Wirtschaftsinformatik 2008.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik.
S. 437-438, englisch.
Berlin: GITO-Verlag, Februar 2008.
Artikel in Tagungsband (Konferenz-Beitrag).
KörperschaftMultikonferenz Wirtschaftsinformatik 2008
CR-Klassif.D.3.0 (Programming Languages General)
G.4 (Mathematical Software)
Kurzfassung

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.

Abteilung(en)Universität Stuttgart, Institut für Architektur von Anwendungssystemen, Architektur von Anwendungssystemen
Eingabedatum29. Februar 2008
   Publ. Institut   Publ. Informatik