Manuscript En02-C@1 · En02-C-v1.tex · proposition · 7549c6df

Proposition: Completion and storage of the stated schedule

Operational thresholds and completion times › A physical clock only after declaring durations · lines 1686–1706 · proof included or linked

En02-C@1#prop:deadline

Back to manuscript

The two-slot programme has worst-history completion time

T_{finish} = max {a_{3}, a_{2} + 5 τ} + 3 τ .

If $a_{3} \geq a_{2} + 5 τ$ , its total observer storage peak is two. If $a_{3} < a_{2} + 5 τ$ , a supplier holds carrier $3$ while the laboratory still holds the first two, so total storage reaches three. A deadline at least the displayed completion time is sufficient for this programme.

Proof. The early gates cannot start before the second carrier arrives. The third can be accepted after both its availability and completion of the early readout. The late gate bound gives the formula. The storage statements inspect the same live intervals.

Displayed formulas in this passage

unlabeled · line 1689
$T_{finish} = max {a_{3}, a_{2} + 5 τ} + 3 τ .$

Proposition: Completion and storage of the stated schedule

Displayed formulas in this passage

Nearby in this section