He drew on the whiteboard:
You have $n$ processes. They have inputs. They talk to each other. Some might crash. The order in which they speak changes the outcome. Trying to model every possible execution path is like trying to map every grain of sand in a desert. distributed computing through combinatorial topology pdf
Represents the "shattering" of possible system states as an algorithm executes over time. distributed computing through combinatorial topology pdf