Proof of Theorem 1: under CAF and (14), the buffers of machines in minimal classes are bounded
ProvedKumarSeidman.CAF.minimal_class_boundedclear-a-fractionmanufacturing-systemsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stability
Let the system satisfy (14), and consider a trajectory under a CAF policy with constants , , from any initial state. If the class of machine is minimal for the partial order on diconnected classes (no other class has a path into it), then every buffer of is bounded over all time:
This is the base case of the induction over the classes of machines that proves Theorem 1.
Formalization Note The bound may depend on the trajectory. Minimality is stated as: every machine from which is reachable is reachable from .
Preamble
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
Formal statement
namespace KumarSeidman.CAF
/-- Boundedness on the minimal classes (p. 295): under (14) and a CAF policy, the levels of
the buffers of every machine `m` whose class is minimal are bounded on `[0, ∞)`. -/
theorem minimal_class_bounded {P M : ℕ} (S : System P M) (h14 : S.StringentCapacityCondition)
(ε K : Fin M → ℝ) (T : Trajectory S) (hT : T.IsCAF ε K) (m : Fin M)
(hmin : S.IsMinimal m) :
∀ b ∈ S.B m, ∃ C : ℝ, ∀ t : ℝ, 0 ≤ t → T.x b t ≤ C := by sorry
end KumarSeidman.CAF
Source
Kumar & Seidman, Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems, IEEE Trans. Automat. Control 35(3), 1990, p. 295, proof of Theorem 1, boundedness on the minimal elements G_1, …, G_l
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.