(18): drift of V_m between consecutive set-up commencements at a machine of a minimal class
ProvedKumarSeidman.CAF.drift_at_setupsLet the system satisfy condition (14), for every machine , and consider a trajectory under a clearing policy. Let be a machine whose class is minimal for the partial order of diconnected classes, and let be two consecutive times at which commences a set-up. Then
where is the Lyapunov function (15) and the largest set-up time between buffers of .
Over one cycle of machine the work it receives is at most per unit time, while it completes work at unit rate except during the set-up and while starved; this drift inequality drives the boundedness of on minimal classes.
Formalization Note are the starts of two consecutive runs and of , which need not be strictly ordered. Only the clearing property is assumed (the paper is in the CAF context, but (18) uses only Definition 1). is not assumed positive; the paper's "" is a remark. The minimality of the class of is stated without quotients: every machine from which is reachable is reachable from .
import Mathlib import Definitions.Def_KumarSeidman_CAF_System import Definitions.Def_KumarSeidman_CAF_Trajectory import Definitions.Def_KumarSeidman_CAF_Policy import Definitions.Def_KumarSeidman_CAF_Lyapunov
namespace KumarSeidman.CAF
/-- (18) (p. 295): under (14) and a clearing policy, for a machine `m` whose class is minimal
and two consecutive set-up commencements `T_n = s_k`, `T_{n+1} = s_{k+1}` (`k ≥ 1`) at `m`,
`V_m(T_{n+1}) ≤ max [0, V_m(T_n) − (1 − ρ'_m)(T_{n+1} − T_n) + δ̄]`. -/
theorem drift_at_setups {P M : ℕ} (S : System P M) (h14 : S.StringentCapacityCondition)
(T : Trajectory S) (hT : T.IsClearing) (m : Fin M) (hmin : S.IsMinimal m) (k : ℕ)
(hk : 1 ≤ k) (hnext : T.HasNext m k) :
T.V m (T.s m (k + 1)) ≤
max 0 (T.V m (T.s m k) - (1 - S.rhoPrime m) * (T.s m (k + 1) - T.s m k)
+ S.deltaBar m) := by sorry
end KumarSeidman.CAF
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.