View source for OR-Join

{{Syntax
|IsSubClassOf=OR Operator
|Successors=Function, Event, Operator, Process interface
|Predecessors=Function, Event, Operator, Process interface
|HasIncomingControlFlow=2, n
|HasOutgoingControlFlow=1
|HasResource=0
|HasAttribute=0
}}
==Short Description==


An OR-Join Operator is a subtype of an [[OR Operator]]. <br>It is responsible for  merging a split control flow, when the token(s) of the previously activated branch(es) converge.[1]
That is why OR-Join could have multiple incoming arcs and just one outgoing arc:<br>
C<sub>oj</sub> = {c ∈ C | l(c) = or ∧ |cout| = 1}. [2]

<br>
An [[OR-Join]] waits for an arriving token on each of its incoming arcs, propagates it to the outgoing arc and activates its successor. In contrast to a [[XOR-Join]] the OR-Join must wait until all tokens have arrived. The decision whether more tokens can arrive on the incoming arcs cannot be made locally at the OR-Join, it depends on the behavior of the corresponding [[OR-Split]]. <br>E.g. when the split has sent three tokens on different outgoing arcs, the join has to wait for exactly these three tokens to arrive in order to continue the process.[3] Therefore, the semantics of the OR-Join connector is called non-local.[1]

== References ==
<div class="toccolours mw-collapsible mw-collapsed">
<br>
<div class="mw-collapsible-content">
<references />

* [*1] N. Cuntz and E. Kindler, “On the Semantics of EPCs: Efficient Calculation and Simulation,” Bus. Process Manag., pp. 398–403, 2005.
* [*2] E. Kindler "On the semantics of EPCs: resolving the vicious circle", Data & Knowledge Engineering - Special issue: Business process management archive Volume 56 Issue 1, 2006, pp.23-40.
* [*3] V. Gruhn and R. Laue, “What business process modelers can learn from programmers,” Sci. Comput. Program., vol. 65, no. 1, pp. 4–13, 2007.
</div>
</div>