In Theorem 9, assume that there exists an upper bound on message transmission times. Which (if any) variant of concurrent common knowledge can hold in the system? please state your assumptions clearly to justify your reasoning used in your answer.
Theorem 9
There does not exit any protocol for two processes to reach common knowledge about a binary value in a reliable asynchronous message-passing system without an upper bound on message transmission times.