Consider the following BPMN diagram.
a) Explain the different semantics that can be given to OR-joins.
b) Translate the BPMN diagram to a workflow net. Try to resolve all OR-joins in such a way that the execution semantics you choose are properly represented.
c) Is it always possible to map OR-joins to Petri nets? Would the YAWL semantics for OR-joins make any difference to your solution in this example?