loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007)
Getting Rid of the OR-Join in Business Process Models
Annapolis, Maryland, USA
October 15-October 19
ISBN: 0-7695-2891-0
J. Mendling, Queensland University of Technology, Australia
B.F. van Dongen, Eindhoven University of Technology, The Netherlands
W.M.P. van der Aalst, Eindhoven University of Technology, The Netherlands
In practice, the development of process-aware informa- tion systems suffers from a gap between conceptual business process models and executable workflow specifications. Be- cause of this gap, conceptual models are hardly reused as execution templates. In this paper, we address the noto- rious "OR-join problem" that is partly responsible for this gap. At the conceptual level people frequently use OR-joins. However, given their non-local semantics, OR-joins cannot be mapped easily onto executable languages. In particular, we present a new approach to map a conceptual process model with OR-joins (expressed in terms of an EPC) onto an executable model without OR-joins (expressed in terms of a Petri net). Although we used an EPC process model as a run- ning example, the approach is equally applicable to other process modeling languages that offer OR-joins as (e.g. BPMN). Moreover, the resulting Petri net can be mapped onto other execution languages such as BPEL. All of this has been implemented in the context of the ProM frame- work.
Citation:
J. Mendling, B.F. van Dongen, W.M.P. van der Aalst, "Getting Rid of the OR-Join in Business Process Models," edoc, pp.3, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.