Article in Proceedings INPROC-2003-57

BibliographyCurbera, Francisco; Khalaf, Rania; Leymann, Frank; Weerawarana, Sanjiva: Exception Handling in the BPEL4WS Language.
In: van der Aalst, Wil M. P. (ed.); ter Hofstede, Arthur H. M. (ed.); Weske, Mathias (ed.): Business Process Management.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
Lecture Notes in Computer Science; 2678, pp. 276-290, english.
Springer, January 2003.
ISBN: 3-540-40318-3; DOI: 10.1007/3-540-44895-0_19.
Article in Proceedings (Conference Paper).
CR-SchemaH.4.1 (Office Automation)
K.1 (The Computer Industry)
F.3.2 (Semantics of Programming Languages)
Abstract

Graph oriented models are at the core of most business process management systems. In recent years, “algebraic” business process modeling languages based on different process calculi have been proposed. The semantics of these algebraic process languages are quite different, and seemingly incompatible, with those of graph oriented approaches. In this paper we study how the BPEL4WS exception handling mechanism is used to integrate the algebraic and graph process models. Unlike other approaches to exception handling in business processes, the BPEL4WS model does not require that the process topology be constrained by the exception handling hierarchy, thus allowing both highly structured and graph based processes to benefit from it. Based on this exception handling model, we explain “dead path elimination” (the runtime mechanism by which process termination is ensured) as a form of exception processing. The integration of dead path elimination with the exception handling mechanism provides the semantic base for the integration of the graph and algebraic processes models in BPEL4WS.

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