Library prosa.analysis.facts.behavior.execution
Consider jobs with arrival times and costs on any processor model.
Consider a schedule of an arrival sequence.
Schedule validity requires scheduled jobs to belong to the arrival sequence.
Lemma valid_schedule_of_arrivals_jobs_come_from_arrival_sequence :
valid_schedule_of_arrivals sched arr_seq →
jobs_come_from_arrival_sequence sched arr_seq.
valid_schedule_of_arrivals sched arr_seq →
jobs_come_from_arrival_sequence sched arr_seq.
Schedule validity excludes execution before arrival.
Lemma valid_schedule_of_arrivals_implies_jobs_must_arrive_to_execute :
valid_schedule_of_arrivals sched arr_seq → jobs_must_arrive_to_execute sched.
valid_schedule_of_arrivals sched arr_seq → jobs_must_arrive_to_execute sched.
Schedule validity excludes execution after completion.
Lemma valid_schedule_of_arrivals_implies_completed_jobs_dont_execute :
valid_schedule_of_arrivals sched arr_seq → completed_jobs_dont_execute sched.
valid_schedule_of_arrivals sched arr_seq → completed_jobs_dont_execute sched.
In particular, any job that executes is pending.
Lemma valid_schedule_of_arrivals_implies_scheduled_jobs_pending :
valid_schedule_of_arrivals sched arr_seq →
∀ j t,
scheduled_at sched j t →
pending sched j t.
End ValidScheduleOfArrivals.
valid_schedule_of_arrivals sched arr_seq →
∀ j t,
scheduled_at sched j t →
pending sched j t.
End ValidScheduleOfArrivals.
Make the execution constraints available to basic proof automation.
Global Hint Resolve
valid_schedule_of_arrivals_jobs_come_from_arrival_sequence
valid_schedule_of_arrivals_implies_jobs_must_arrive_to_execute
valid_schedule_of_arrivals_implies_completed_jobs_dont_execute
valid_schedule_of_arrivals_implies_scheduled_jobs_pending
: basic_rt_facts.
valid_schedule_of_arrivals_jobs_come_from_arrival_sequence
valid_schedule_of_arrivals_implies_jobs_must_arrive_to_execute
valid_schedule_of_arrivals_implies_completed_jobs_dont_execute
valid_schedule_of_arrivals_implies_scheduled_jobs_pending
: basic_rt_facts.