pith. sign in

arxiv: 2508.16450 · v1 · pith:QLYT7C74new · submitted 2025-08-22 · 📡 eess.SY · cs.SY

Performance analysis for cone-preserving switched systems with constrained switching

Marc Seidel , Richard Pates , Frank Allg\"ower This is my paper

Pith reviewed 2026-05-18 21:29 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords cone-preserving switched systemsperformance analysispositive switched systemsconstrained switchingdiscrete-time systemsl1 performanceLyapunov functionsautomaton switching
0
0 comments X

The pith

Cone-preserving linear discrete-time switched systems with automaton-governed switching admit performance analysis conditions that generalize prior results for switched and positive systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper focuses on cone-preserving linear discrete-time switched systems whose switching is dictated by an automaton. It derives conditions to analyze a general performance measure for this class. These conditions unify and extend earlier stability and performance results for switched systems and for positive switched systems. They also produce new explicit conditions for l1-performance analysis in the positive case under constrained switching, supported by a numerical example drawn from applications. The cone-preserving viewpoint further clarifies how to select Lyapunov functions for these systems.

Core claim

For cone-preserving linear discrete-time switched systems whose switching is governed by an automaton, performance analysis conditions exist for a broadly usable performance measure; these conditions generalize known results for performance and stability analysis of switched and positive switched systems while supplying novel l1-performance conditions for positive switched systems with constrained switching.

What carries the argument

The cone-preserving property of the linear maps together with automaton-constrained switching, which together allow derivation of the performance conditions and the unifying perspective.

Load-bearing premise

The systems must be cone-preserving linear discrete-time switched systems whose switching follows an automaton, and this structure must permit derivation of conditions that generalize earlier results.

What would settle it

A concrete switched system that satisfies the cone-preserving and automaton conditions yet violates the derived performance inequalities in a direct numerical check would falsify the analysis conditions.

Figures

Figures reproduced from arXiv: 2508.16450 by Frank Allg\"ower, Marc Seidel, Richard Pates.

Figure 1
Figure 1. Figure 1: Switching rule graph for the virus mitigation system. [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
read the original abstract

This paper studies cone-preserving linear discrete-time switched systems whose switching is governed by an automaton. For this general system class, we present performance analysis conditions for a broadly usable performance measure. In doing so, we generalize several known results for performance and stability analysis for switched and positive switched systems, providing a unifying perspective. We also arrive at novel $\ell_1$-performance analysis conditions for positive switched systems with constrained switching, for which we present an application-motivated numerical example. Further, the cone-preserving perspective provides insights into appropriate Lyapunov function selection.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 3 minor

Summary. This paper studies cone-preserving linear discrete-time switched systems whose switching is governed by an automaton. It derives performance analysis conditions for a general performance measure that unify and generalize prior stability and performance results for switched and positive switched systems. The work also develops novel ℓ1-performance conditions specifically for positive switched systems under constrained switching, illustrated via an application-motivated numerical example, and discusses how the cone-preserving viewpoint informs Lyapunov function selection.

Significance. If the derivations hold, the manuscript supplies a unifying cone-based framework that extends existing techniques for positive and switched systems to the setting of automaton-constrained transitions. This is potentially significant for analysis of systems with positivity constraints and limited switching sequences, such as certain network or compartmental models. The novel ℓ1 conditions and the concrete numerical example add practical value, while the Lyapunov insights may guide function choice in related problems.

major comments (1)
  1. [§3, Theorem 2] §3, Theorem 2: The performance bound in Eq. (12) is stated to hold under the automaton constraints, but the proof does not explicitly show that the cone intersection with each allowed transition set remains invariant and that the induced norm remains finite; this step is load-bearing for the generalization claim.
minor comments (3)
  1. [§2.2] The definition of the performance measure in §2.2 uses a generic notation that could be confused with standard ℓ1 or induced norms; an explicit comparison table with prior measures would improve clarity.
  2. [§5] In the numerical example of §5, the automaton diagram (Fig. 2) lacks labels on the transition probabilities or rates; adding these would make the constrained-switching setup easier to verify.
  3. [Introduction] Several references to earlier results on positive switched systems (e.g., in the introduction) are cited by number only; including a short sentence summarizing each would help readers see the precise generalization.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback. The manuscript has been revised to address the point raised on the proof of Theorem 2.

read point-by-point responses

  1. Referee: [§3, Theorem 2] §3, Theorem 2: The performance bound in Eq. (12) is stated to hold under the automaton constraints, but the proof does not explicitly show that the cone intersection with each allowed transition set remains invariant and that the induced norm remains finite; this step is load-bearing for the generalization claim.

    Authors: We appreciate the referee drawing attention to this step in the proof of Theorem 2. Upon re-examination, we agree that an explicit verification strengthens the argument for the generalization to automaton-constrained switching. In the revised manuscript we have expanded the proof of Theorem 2 with two additional paragraphs. The first shows that, for every allowed transition (i,j) in the automaton, the intersection of the cone with the transition set is forward-invariant under the corresponding subsystem dynamics, using the cone-preserving assumption and the fact that the transition sets are defined to be compatible with the cone. The second paragraph establishes finiteness of the induced norm by deriving an explicit upper bound from the performance measure and the positivity of the system matrices. These additions make the load-bearing step fully explicit while preserving the original line of reasoning. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives performance analysis conditions for cone-preserving linear discrete-time switched systems governed by automata, generalizing prior stability and performance results for switched and positive switched systems while adding novel ℓ1 conditions. No load-bearing step reduces by construction to a self-definition, a fitted input renamed as prediction, or a self-citation chain that forces the central claim. The cone-preserving property and adapted Lyapunov/storage functions are standard extensions of existing techniques, with the derivation remaining independent of the authors' own prior fitted quantities or unverified uniqueness theorems. The analysis is self-contained against external benchmarks for this system class.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on the domain assumption that the studied systems are cone-preserving and that their switching is governed by an automaton; no free parameters or invented entities are mentioned in the abstract.

axioms (1)
  • domain assumption The systems are cone-preserving linear discrete-time switched systems whose switching is governed by an automaton.
    This defines the general system class for which performance conditions are presented (abstract opening sentence).

pith-pipeline@v0.9.0 · 5613 in / 1214 out tokens · 50027 ms · 2026-05-18T21:29:16.521500+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results,

    H. Lin and P. J. Antsaklis, “Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results,” IEEE Trans. Autom. Control, vol. 54, no. 2, pp. 308–322, 2009

    work page 2009

  2. [2]

    A Tutorial on Positive Systems and Large Scale Control,

    A. Rantzer and M. E. Valcher, “A Tutorial on Positive Systems and Large Scale Control,” in Proc. 57th Conf. Decision and Control (CDC) , pp. 3686–3697, 2018

    work page 2018

  3. [3]

    l1-induced norm and controller synthesis of positive systems,

    X. Chen, J. Lam, P. Li, and Z. Shu, “l1-induced norm and controller synthesis of positive systems,” Automatica, vol. 49, no. 5, pp. 1377– 1385, 2013

    work page 2013

  4. [4]

    Stability and Stabilizability Criteria for Discrete-Time Positive Switched Systems,

    E. Fornasini and M. E. Valcher, “Stability and Stabilizability Criteria for Discrete-Time Positive Switched Systems,” IEEE Trans. Autom. Control, vol. 57, no. 5, pp. 1208–1221, 2012

    work page 2012

  5. [5]

    Stability Analysis of Switched Positive Systems: A Switched Linear Copositive Lyapunov Function Method,

    X. Liu, “Stability Analysis of Switched Positive Systems: A Switched Linear Copositive Lyapunov Function Method,” IEEE Trans. Circuits and Systems II: Express Brief , vol. 56, no. 5, pp. 414–418, 2009

    work page 2009

  6. [6]

    Input–output gain analysis for linear systems on cones,

    J. Shen and J. Lam, “Input–output gain analysis for linear systems on cones,” Automatica, vol. 77, pp. 44–50, Mar. 2017

    work page 2017

  7. [7]

    Path-complete positivity of switching systems,

    F. Forni, R. Jungers, and R. Sepulchre, “Path-complete positivity of switching systems,” IFAC-PapersOnLine, vol. 50, no. 1, pp. 4558–4563, 2017

    work page 2017

  8. [8]

    Stability of Linear Systems Under Extended Weakly-Hard Constraints,

    N. Vreman, P. Pazzaglia, V . Magron, J. Wang, and M. Maggio, “Stability of Linear Systems Under Extended Weakly-Hard Constraints,” IEEE Control Systems Letters , vol. 6, pp. 2900–2905, 2022

    work page 2022

  9. [9]

    On ℓ2-performance of weakly- hard real-time control systems,

    M. Seidel, S. Lang, and F. Allg ¨ower, “On ℓ2-performance of weakly- hard real-time control systems,” European Journal of Control , vol. 80, p. 101056, 2024

    work page 2024

  10. [10]

    Graph-Based Restricted and Arbitrary Switching for Switched Positive Systems via a Weak CLCLF,

    S. An, F. Wu, J. Lian, and D. Wang, “Graph-Based Restricted and Arbitrary Switching for Switched Positive Systems via a Weak CLCLF,” IEEE Trans. Cybernetics , vol. 54, no. 8, pp. 4454–4463, 2024

    work page 2024

  11. [11]

    Benzaouia, Stability and Stabilization of Positive Switching Linear Discrete-Time Systems, pp

    A. Benzaouia, Stability and Stabilization of Positive Switching Linear Discrete-Time Systems, pp. 195–216. Springer London, 2012

    work page 2012

  12. [12]

    Stability of switched linear systems on cones: A generating function approach,

    J. Shen and J. Hu, “Stability of switched linear systems on cones: A generating function approach,” in Proc. 49th Conf. Decision and Control (CDC), pp. 420–425, 2010

    work page 2010

  13. [13]

    Copositive Lyapunov functions for switched systems over cones,

    S. Bundfuss and M. D ¨ur, “Copositive Lyapunov functions for switched systems over cones,” Systems & Control Letters, vol. 58, no. 5, pp. 342– 345, 2009

    work page 2009

  14. [14]

    Input–Output Gain Analysis of Linear Discrete-Time Systems With Cone Invariance,

    B. Zhu, J. Lam, J. Shen, Y . Cui, X. Lu, and K.-W. Kwok, “Input–Output Gain Analysis of Linear Discrete-Time Systems With Cone Invariance,” IEEE Trans. Autom. Control , vol. 69, no. 12, pp. 8751–8757, 2024

    work page 2024

  15. [15]

    Boyd and L

    S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2004

    work page 2004

  16. [16]

    Comparison theorems using general cones for norms of iteration matrices,

    T. I. Seidman, H. Schneider, and M. Arav, “Comparison theorems using general cones for norms of iteration matrices,” Linear Algebra and its Applications , vol. 399, pp. 169–186, 2005

    work page 2005

  17. [17]

    Stabilization and performance analysis for a class of switched systems,

    L. Fang, H. Lin, and P. Antsaklis, “Stabilization and performance analysis for a class of switched systems,” in Proc. 43rd Conf. Decision and Control (CDC) , vol. 3, pp. 3265–3270, 2004

    work page 2004

  18. [18]

    Switching Stabilization and l2 Gain Performance Controller Synthesis for Discrete-Time Switched Linear Systems,

    H. Lin and P. J. Antsaklis, “Switching Stabilization and l2 Gain Performance Controller Synthesis for Discrete-Time Switched Linear Systems,” in Proc. 45th Conf. Decision and Control (CDC) , 2006

    work page 2006

  19. [19]

    R. E. Skelton, T. Iwasaki, and K. M. Grigoriadis, Unified Algebraic Approach to Control Design . CRC Press LLC, 2017

    work page 2017

  20. [20]

    Stabilization of networked control systems with weakly hard real-time dropout description,

    S. Linsenmayer and F. Allg ¨ower, “Stabilization of networked control systems with weakly hard real-time dropout description,” in Proc. 56th Conf. Decision and Control (CDC) , pp. 4765–4770, 2017

    work page 2017