Run the algorithim for n>6. to introduce non-
determinism, number each process 0..n-1; In each
iteration, generate a random number r<=n.choose r
processes randomly and allow only the chosen ones to
execute the protocol. token sending/ recieving can be
emulated by updating appropriate recieved[] bits.
ignoring the diffusion part, see how many processes
decide in at least three different trees. if numbers
are the same , it is a coincident?

It would be more productive if you told us what errors you were getting rather than begging for free solutions to your homework.