 If there are n concurrent threads running, a process graph models the execution of n concurrent threads and their trajectories through an n dimensional Cartesian plane.The origin of the graph corresponds to the initial state where none of the threads have completed an instruction.Each directed edge corresponds to the execution of an instruction and transition to other.