Lemma 1 2): a full queued run lowers the backlog by
ProvedKumarSeidman.Supervisor.lemma1_backlog_decreaselyapunovmanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingsupervisory-control
Under (1), (24) and , let a supervised trajectory be given, and suppose buffer of machine enters at time and its subsequent processing run is completed at . With the backlog ,
The backlog is the Lyapunov-type quantity of the stability proof: each service of a large queued buffer removes a fixed amount of it.
Formalization Note The subsequent run is the first run on that starts at or after and ends after it; its existence is Lemma 1 1). The weight multiplies every term of the backlog, as printed.
Preamble
import Mathlib import Definitions.Def_KumarSeidman_Supervisor_System import Definitions.Def_KumarSeidman_Supervisor_Trajectory import Definitions.Def_KumarSeidman_Supervisor_Mechanism
Formal statement
namespace KumarSeidman.Supervisor
/-- Lemma 1 2) (Kumar–Seidman 1990, p. 296). If buffer `b = b_{p,i}` enters `Q_m` at
`t_in` with `x_{p,i}(t_in) ≥ γ_m d_p`, then at the completion `t_complete` of its subsequent
processing run the backlog has dropped by at least `ζ_m d_p τ_{p,i}`. -/
theorem lemma1_backlog_decrease {P M : ℕ} (S : System P M) (hcap : S.CapacityCondition)
(γ : Fin M → ℝ) (hγ : GammaCondition S γ) (z : Buffer S → ℝ) (hz : ∀ b, 0 ≤ z b)
(T : Trajectory S) (hT : T.Supervised γ z) (b : Buffer S) (tIn : ℝ)
(hin : T.EntersQ z b tIn) (k : ℕ) (hk : T.IsNextRun b tIn k)
(hnext : T.HasNext (S.mach b) k)
(hlevel : γ (S.mach b) * S.d b.1 ≤ T.x b tIn) :
backlog T b (T.s (S.mach b) (k + 1)) ≤
backlog T b tIn - zeta S γ (S.mach b) * S.d b.1 * S.tau b := by sorry
end KumarSeidman.Supervisor
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, p. 296, Lemma 1 2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.