Library prosa.analysis.definitions.infinite_jobs
In this section we define the notion of infinitely many job arrivals
for a task.
Consider any type of tasks ...
... and any type of jobs associated with these tasks.
Consider any arrival sequence.
We say that a task tsk has infinitely many job arrivals
if for every integer n there exists a job j of task tsk
such that job_index of j is equal to n.
Definition infinite_jobs (tsk : Task) :=
∀ n,
∃ j,
arrives_in arr_seq j
∧ job_task j = tsk
∧ job_index arr_seq j = n.
∀ n,
∃ j,
arrives_in arr_seq j
∧ job_task j = tsk
∧ job_index arr_seq j = n.
We lift the infinite-arrival requirement to a set of
tasks being analyzed.
Definition tasks_have_infinite_arrivals (ts : TaskSet Task) :=
∀ tsk,
tsk \in ts →
infinite_jobs tsk.
End InfiniteJobs.
∀ tsk,
tsk \in ts →
infinite_jobs tsk.
End InfiniteJobs.