[CST-2] D CommII and TinC

[Shu Yan Chan]

I got some little questions which  I do not managed to clear it up over the
year, I hope it is not too late to ask:

Digital Communication II:

P.44 and 46 of Steven Hand notes, the graphs of cwin against time.  Why
after the first time out and the cwin drops, cwin does not seem to be under
niether linear nor expoential increase? In P.44 Steve Hand  said it is in
congestion avoidance after 2ms, but why we still got packet loss???

Routing table in P17.  Node B will route an packet addressed 0.0.0.0
(destination = this host) to the hop R4, would it change the destination so
that the hop R4 know that it got to send back to node B?  Otherwise, would
the 0.0.0.0 routing entry in hop R4 look like?

Topic in Concurrency:

Have we been shown any example of an assertion in Hennessy-Milner Logic
(P.69) at all?   The definition is sort of recursively defined.  My problem
is that, I am assuming that the basic element for those assertions would be
like those used in CCS or CTL, i.e. it could be a set of state/process.
Then, how can we be convince that if an assertion is true for B, and B is
bisimiliar to C, the assertion would also be true for C as well?  If the
assertion is just true for state/process B, then it would not hold true for
C...  Clearly I have some big miss understanding somewhere...

Also, the definition of observsation congruent (P.75).  On my notes, I have
some scribble   on my notes saying if alpha is tau, then the '  => ' with
alpha action in this context does not allow the case of zero tau-action for
q to become q' ?   Is it what Prof  WInskel said?  Or is it just a comment
by my supervisor?  Or my own speculation?   More importantly, is it correct?
Is nil  = tau.nil ?

Many thanks.

Yours,
Shu Yan