“…Therefore, it is advisable to transform BPMN to some other formalism, such as, for example, YAWL nets, which can be analysed for correctness and, in addition, can also be simulated, animated and executed. In order to achieve this, the work in [98] defines an execution semantics for a subset of BPMN (2.0) in terms of graph rewrite rules, which are the basic building blocks of graph transformations. As mentioned in Section 4.3, graph rewrite rules consist of a left-hand side, which defines the condition in which a rule should be applied, and a right-hand side, which defines what should be realised when the left-hand side is fulfilled.…”