Semantics of standard process models with OR-joins

Authors:
Marlon Dumas;Alexander Grosskopf;Thomas Hettel;Moe Wynn
Affiliations:
Queensland University of Technology, Australia and University of Tartu, Estonia;Hasso-Plattner Institute, Potsdam, Germany;SAP Research Centre Brisbane, Australia and Queensland University of Technology, Australia;Queensland University of Technology, Australia
Venue:
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Year:
2007

Citing 6
Cited 5

Workflow Patterns

Distributed and Parallel Databases
On the semantics of EPCs: resolving the vicious circle

Data & Knowledge Engineering - Special issue: Business process management
Integration testing in software product line engineering: a model-based technique

FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Formalization and verification of EPCs with OR-joins based on state and context

CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
On the semantics of EPCs: efficient calculation and simulation

BPM'05 Proceedings of the 3rd international conference on Business Process Management
Achieving a general, formal and decidable approach to the OR-Join in workflow using reset nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

BPEL to BPMN: The Myth of a Straight-Forward Mapping

OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
A new semantics for the inclusive converging gateway in safe processes

BPM'10 Proceedings of the 8th international conference on Business process management
Formal semantics and implementation of BPMN 2.0 inclusive gateways

WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Approaches to modeling business processes: a critical analysis of BPMN, workflow patterns and YAWL

Software and Systems Modeling (SoSyM)
A visual token-based formalization of BPMN 2.0 based on in-place transformations

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Business Process Modeling Notation (BPMN) is an emerging standard for capturing business processes. Like its predecessors, BPMN lacks a formal semantics and many of its features are subject to interpretation. One construct of BPMN that has an ambiguous semantics is the OR-join. Several formal semantics of this construct have been proposed for similar languages such as EPCs and YAWL. However, these existing semantics are computationally expensive. This paper formulates a semantics of the OR-join in BPMN for which enablement of an OR-join in a process model can be evaluated in quadratic time in terms of the total number of elements in the model. This complexity can be reduced down to linear-time after materializing a quadratic-sized data structure at design-time. The paper also shows how to efficiently detect the enablement of an OR-join incrementally as the execution of a process instance unfolds.