Library prosa.model.schedule.scheduled
The Scheduled Job(s)
In this file, we provide a computable definition of the (set of) scheduled
job(s) at a given point in time. Importantly, the below definition is
independent of the type of processor state. Consequently, it can be used for
case analyses in generic analyses (e.g., something is scheduled or not,
without making assumptions on the specific type of processor state).
Consider any type of jobs, ...
... any kind of processor, ...
... any arrival sequence, ...
... and any schedule.
The set of jobs scheduled at time
t can be obtained by filtering the set
of all jobs that arrive at or before time
t.
For the special case of uniprocessors, we define a convenience wrapper
that reduces the sequence of scheduled jobs to an
option Job.