On Defining the Behavior of OR-joins in Business Process Models

Borger, E., Sörensen, O. and Thalheim, Bernhard (2009) On Defining the Behavior of OR-joins in Business Process Models Journal of Universal Computer Science, 15 (1). pp. 3-32.

Full text not available from this repository.


The recent literature on business process modeling notations contains numerous contributions to the so-called OR-join (or inclusive merge gateway) problem. We analyze the problem and present an approach to solve it without compromising any of the two major concerns that are involved: a) a clear semantical definition (design), which also clarifies what has to be implemented to achieve the intended generality of the construct, and b) a comprehensive set of static and dynamic analysis methods (verification of properties of business process models using the construct). We provide a conceptually simple scheme for dynamic OR-join synchronization policies, which can be implemented with low run-time overhead and allows the practitioner to effectively link the design of business process models with OR-joins to an analysis of the intended model properties. The definitions have been experimentally validated by a graph-based simulator.(2)

Document Type: Article
Keywords: business processesor-join problem bpmn standard workflow patterns vicious circle reset nets semantics epcs
Research affiliation: Kiel University
OceanRep > The Future Ocean - Cluster of Excellence
Refereed: Yes
ISSN: 0948-695X
Projects: Future Ocean
Date Deposited: 11 Feb 2011 12:14
Last Modified: 28 Sep 2017 13:00
URI: http://eprints.uni-kiel.de/id/eprint/9305

Actions (login required)

View Item View Item