Library prosa.analysis.facts.readiness.basic

Throughout this file, we assume the basic (i.e., Liu & Layland) readiness model.
Consider any kind of jobs...
  Context {Job : JobType}.

... and any kind of processor state.
  Context {PState : Type}.
  Context `{ProcessorState Job PState}.

Suppose jobs have an arrival time and a cost.
  Context `{JobArrival Job} `{JobCost Job}.

In the basic Liu & Layland model, a schedule satisfies that only ready jobs execute as long as jobs must arrive to execute and completed jobs don't execute, which we note with the following theorem.
The Liu & Layland readiness model is trivially non-clairvoyant.