(pattern implementation) Figure 8.12 contains a YAWL specification in which the edges are labeled with Boolean expressions C 1, C 2, C 3, and their negations. This specification contains an arbitrary...

(pattern implementation) Figure 8.12 contains a YAWL specification in which the edges are labeled with Boolean expressions C 1, C 2, C 3, and their negations. This specification contains an arbitrary loop in which tasks B and C can be repeated multiple times in alternation until the process completes. A possible execution of this process specification is AB , that is, task A is executed, then predicate C 1 is true so B is executed, after which predicate C 2 is false so the process terminates. Other possible executions include AC , ABC , ACB , ABCB , ACBC , etc. Some process modeling or process execution languages only provide constructs for structured loops [e.g., constructs of the form while (boolean expression) {fragment of process to be repeated}], as in contemporary imperative pro-gramming languages such as C and Java.8 How could the specification in Figure 8.12 be expressed in a language that provides “while” loops, conditional statements of the form if (boolean expression) {fragment of process}, and simple sequencing between tasks (which can be denoted using a semicolon “;”), but does not support arbitrary loops. Consider each of the following two cases: