Predicting Temporal Exceptions in Concurrent Workflows Table 1. Durations and resource usage for the tasks in both workflows Task T T11 T12 T13 T14 T15 T16 T21 T22 T23 T24 T25 T26 T27 T28 Duration D(T) 5 2 5 3 1 5 2 3 5 4 2 2 1 6 Resource Usage R(T) 2 1 4 2 2 1 1 2 3 3 1 1 1 4 (53) is calculated from the resulting conflict-free execution trace. Next we apply Algorithm 4 to find their shortest paths. For wf1, the shortest path that starts with T11 T12 T14 T15 T16 T12 T14 T15 T16 is T11 T12 T14 T15 T16 T12 T14 T15 T16. For wf2, the shortest path that starts with T21 T22 T25 T26 T27 T28 T21 T22 T23 is T21 T22 T25 T26 T27 T28 T21 T22 T23 T24 T27 T28 (see Figure 12 (d)). These two shortest paths are fed into Al- gorithm 4 and the Earliest Completion Time ECT (55) is calculated from the resulting conflict-free execution trace. Since ECT > HD we can predict that an exception may occur in the future. In the next section we will perform an experiment to show how different prediction time points can affect the prediction accuracy.