Library prosa.analysis.facts.model.task_arrivals
In this file we provide basic properties related to tasks on arrival sequences.
Consider any type of job associated with any type of tasks.
Consider any job arrival sequence.
Let tsk be any task.
We show that the number of arrivals of task can be split into disjoint intervals.
Lemma num_arrivals_of_task_cat:
∀ t t1 t2,
t1 ≤ t ≤ t2 →
number_of_task_arrivals arr_seq tsk t1 t2 =
number_of_task_arrivals arr_seq tsk t1 t + number_of_task_arrivals arr_seq tsk t t2.
End TaskArrivals.
∀ t t1 t2,
t1 ≤ t ≤ t2 →
number_of_task_arrivals arr_seq tsk t1 t2 =
number_of_task_arrivals arr_seq tsk t1 t + number_of_task_arrivals arr_seq tsk t t2.
End TaskArrivals.