In a directed graph, the forward star of a node u is defined as its outgoing edges.

A deadlock state can be modeled by a single outgoing edge back to itself.

Each vertex has exactly incoming and outgoing edges.

Each node of the Chance player has a probability distribution over its outgoing edges.

The way to find the minimum outgoing edge will be discussed later.

Then they can identify the minimum outgoing edge from the entire fragment.

A message will be sent from the core to the minimum outgoing edge via a path of branch edges.

This is because, there may not be any node with zero outgoing edges.

Wait for signals from all outgoing edges.

For any given edge, the number of outgoing edges may be arbitrary.