
Limits
--------

The limits offer a solution to the following problem:

When the lookahead table is not empty, then
Addc has to wait for a message from the WrtCtrl
as a result of the top entry of tis table.
The event arrives and typically, its timestamp will be 
greater than the one expected. So AddC continues
to read/send messages to the PCloop until it 
the timestamp of the pc-message gets greater than 
the timestamp of the w-message. 
However this might never occur, as the path
up to the wrtctrl might get full blocking
any more messages to arrive to the AddC and therefore a deadlock 
situation will occur. 

Question: How can the AddC decide weather to wait for a new pc-message
or not?

By checking the limits of each instruction.



