Library prosa.analysis.facts.busy_interval.quiet_time
In this module we collect some basic facts about quiet times.
Consider any kind of jobs...
... and a JLFP policy defined on these jobs.
Consider any processor state model.
Consider any schedule and arrival sequence.
We prove that 0 is always a quiet time.
Lemma zero_is_quiet_time (j : Job) : quiet_time arr_seq sched j 0.
Proof.
by intros jhp ARR HP AB; move: AB; rewrite /arrived_before ltn0.
Qed.
End Facts.
Proof.
by intros jhp ARR HP AB; move: AB; rewrite /arrived_before ltn0.
Qed.
End Facts.