Library prosa.analysis.definitions.blocking_bound_fp
Blocking Bound for FP
In this section, we define a bound on the length of a non-preemptive segment of a lower-priority job (w.r.t. a task tsk) under FP scheduling.
Consider any type of tasks. 
Consider an FP policy. 
Consider an arbitrary task set ts. 
Assuming that tasks are independent, the maximum non-preemptive
      segment length w.r.t. any lower-priority task bounds the maximum
      possible duration of priority inversion.