Getting Rid of the OR-Join in Business Process Models

  • Authors:
  • J. Mendling;B. F. van Dongen;W. M. P. van der Aalst

  • Affiliations:
  • Queensland University of Technology, Australia;Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands

  • Venue:
  • EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.