Glitches as demonstrated via the diamond pattern can be avoided by traversing the graph in topological order. This was demonstrated in Greg Cooper&#x27;s PhD thesis: <a href="http:&#x2F;&#x2F;cs.brown.edu&#x2F;~greg&#x2F;" rel="nofollow">http:&#x2F;&#x2F;cs.brown.edu&#x2F;~greg&#x2F;</a><p>Transactions, as I understand them, solve a different issue. This is the issue of multiple inputs to the graph occurring at the same time.