This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Rules for B:-Same as “standard” go back n-While state j, sends RN =j periodically-Other stuff Show protocol doesn’t get stuck Proof of correctness i = state of A j = state of B i ≤ j ≤ i + n why is the state of i always less than the state of j? If i changes the only thing it can change to is something, possibly Bleh bleh, lets assume all this stuff is true, check if we get stuck or not Suppose B is in state j, we know that A is in state at most j. Two cases i ) state of A = i < j ii ) state of A =j bleh bleh works...
View Full Document
- Spring '11