Semantics of BPMN Process Models with OR-joins
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 a given OR-join in a model can be evaluated in quadratic time in terms of the total number of elements in the model. This complexity can be reduced to linear-time after materializing a quadratic-sized data structure at design-time. The paper also shows how to evaluate enablement of an OR-join incrementally as the execution of a process instance unfolds.
Impact and interest:
Citation countsare sourced monthly fromand citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Keywords:||Business Process Modeling Notation, Or, join, formal semantics|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600) > Conceptual Modelling (080603)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2007 the authors|
|Deposited On:||01 May 2007|
|Last Modified:||30 Jun 2014 11:22|
Repository Staff Only: item control page