You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Dec 13, 2022. It is now read-only.
#888 introduces ncycles_processing and fifo_depth parameters.
We should be able to prove the invariant that the number of busy cycles in the state BUSY cycles doesn't go over (fifo_depth + 1) * ncycles_processing.
@samuelgruetter proposed: forall t s, execution t s -> forall tx, s = BUSY tx -> tx < (fifo_depth + 1) * ncycles_processing
#888 introduces
ncycles_processingandfifo_depthparameters.We should be able to prove the invariant that the number of busy cycles in the state
BUSY cyclesdoesn't go over(fifo_depth + 1) * ncycles_processing.@samuelgruetter proposed:
forall t s, execution t s -> forall tx, s = BUSY tx -> tx < (fifo_depth + 1) * ncycles_processing