One way of describing algorithms is via execution graphs.
Figure 88 shows an example execution graph for the incdec system described in the book ELM.
This example is sequential; however, concurrent execution graphs are also used.