Library prosa.analysis.facts.model.uniprocessor
This file serves to collect basic facts about uniprocessors.
Consider any type of jobs, ...
... any uniprocessor model, ...
... and any schedule.
By definition, if one job is scheduled on a uniprocessor, then no other
job is scheduled at the same time.
Lemma scheduled_job_at_neq :
∀ j j' t,
j != j' →
scheduled_at sched j t →
~~ scheduled_at sched j' t.
End UniquenessOfTheScheduledJob.
∀ j j' t,
j != j' →
scheduled_at sched j t →
~~ scheduled_at sched j' t.
End UniquenessOfTheScheduledJob.