It is possible to have two schedules that produce the same outcome, but that
are not conflict equivalent. For example, consider transaction T5, which transfers
$10 from account B to account A. Let schedule 8 be as defined in Figure 14.13.
We claim that schedule 8 is not conflict equivalent to the serial schedule ,
since, in schedule 8, the write(B) instruction of T5 conflicts with the read(B) instruction
of T1. This creates an edge T5 → T1 in the precedence graph. Similarly,
we see that the write(A) instruction of T1 conflicts with the read instruction of T5