pith. sign in

arxiv: 2603.20146 · v2 · pith:OZATSDVWnew · submitted 2026-03-20 · 📡 eess.SY · cs.SY

A Controller Synthesis Framework for Weakly-Hard Control Systems

Marc Seidel , Martina Maggio , Frank Allg\"ower This is my paper

Pith reviewed 2026-05-15 07:52 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords controller synthesisweakly-hard constraintsreal-time controldeadline missesstability guaranteesoverrun handlingFuruta pendulum
0
0 comments X

The pith

A synthesis framework designs controllers that stay stable and performant despite occasional deadline misses

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

The paper develops a controller synthesis framework that folds weakly-hard timing constraints directly into the design stage rather than checking stability only afterward. The method accommodates several overrun-handling strategies and supplies formal guarantees that the closed-loop system will remain stable and meet performance targets even when deadlines are missed according to the chosen pattern. Experiments on the Furuta pendulum demonstrate that controllers produced by this constraint-aware process deliver measurably better behavior than controllers designed without timing knowledge. The central shift is therefore from reactive verification to proactive incorporation of real-time behavior inside the synthesis procedure itself.

Core claim

The framework explicitly integrates weakly-hard constraints into the controller synthesis procedure, supports multiple overrun-handling strategies, and supplies stability and performance guarantees for the resulting closed-loop system under the modeled miss patterns.

What carries the argument

The direct embedding of weakly-hard constraints inside the synthesis optimization that produces the controller gains while accounting for chosen overrun strategies.

If this is right

  • Stability and performance guarantees hold for any controller produced by the framework under the modeled miss patterns.
  • Several different overrun-handling strategies can be accommodated within the same synthesis procedure.
  • Constraint-aware controllers outperform designs that ignore timing violations on the same plant.
  • The synthesis procedure can be applied to representative control benchmarks such as the Furuta pendulum.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same synthesis structure could be used to explore trade-offs between allowable miss rates and achievable control performance.
  • The framework might extend naturally to plants whose dynamics change when an overrun strategy switches.
  • Designers could use the method to certify controllers for platforms whose timing statistics are only partially known.

Load-bearing premise

The weakly-hard task model together with the selected overrun strategies accurately describes the actual timing behavior of the platform and introduces no unmodeled dynamics that would invalidate the stability guarantees.

What would settle it

A simulation or experiment in which a synthesized controller loses stability or violates performance bounds while deadline misses occur exactly according to the modeled weakly-hard pattern would falsify the claimed guarantees.

Figures

Figures reproduced from arXiv: 2603.20146 by Frank Allg\"ower, Marc Seidel, Martina Maggio.

Figure 2
Figure 2. Figure 2: Example sequences, denoting M, H, R for a miss, hit, or recovery [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 1
Figure 1. Figure 1: Workflow of the proposed controller design framework. [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: Switched system matrices for different actuator and overrun strategy combinations, omitting the time argument of [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example of a WH graph G for the AnyMiss (3, 5) constraint. Optimization Problem 1 (Analysis). The analysis Problem 1 is solved by the LMI problem (9) with δ G = {γ}, where γ ∈ R, and δi = {Si , Gi}, where Si ∈ R (n+m)×(n+m) symmetric, Gi ∈ R (n+m)×(n+m) , i = 1, ..., nV , and M = {Mk | ek = (i, j, l) ∈ E} with Mk =     Gi + G⊤ i − Si ∗ ∗ ∗ (Al + BlK)Gi Sj ∗ ∗ 0 (B w l ) ⊤ γI ∗ (Cl + DlK)Gi 0 Dw l γI  … view at source ↗
Figure 5
Figure 5. Figure 5: The Furuta pendulum used for experimental evaluation. [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
read the original abstract

Deadline misses are more common in real-world systems than one may expect. The weakly-hard task model has become a standard abstraction to describe and analyze how often these misses occur, and has been especially used in control applications. Most existing control approaches check whether a controller manages to stabilize the system it controls when its implementation occasionally misses deadlines. However, they usually do not incorporate deadline-overrun knowledge during the controller synthesis process. In this paper, we present a framework that explicitly integrates weakly-hard constraints into the control design. Our method supports various overrun handling strategies and guarantees stability and performance under weakly-hard constraints. We validate the synthesized controllers on a Furuta pendulum, a representative control benchmark. The results show that constraint-aware controllers significantly outperform traditional designs, demonstrating the benefits of proactive and informed synthesis for overrun-aware real-time control.

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

2 major / 2 minor

Summary. The paper presents a controller synthesis framework that integrates weakly-hard task models directly into the design process for real-time control systems. It supports multiple overrun handling strategies, claims formal stability and performance guarantees under (m,k) constraints, and validates the approach on a Furuta pendulum benchmark where constraint-aware controllers outperform traditional designs.

Significance. If the stability guarantees are shown to hold for every admissible overrun sequence without hidden conservatism, the work would meaningfully advance the integration of scheduling constraints into control synthesis. The Furuta pendulum experiments provide a concrete, reproducible benchmark that could influence embedded control practice.

major comments (2)
  1. [§4.1] §4.1, switched-system formulation: the stability theorem appears to rely on a common Lyapunov function over all admissible hit/miss sequences; this is a sufficient but potentially conservative condition that may not guarantee stability for every worst-case sequence permitted by the weakly-hard bound.
  2. [Experimental section] Experimental section, Furuta pendulum results: the reported outperformance lacks detail on how the specific overrun sequences were sampled or whether they exhaust the admissible set; without this, it is unclear whether the experiments stress-test the claimed guarantees.
minor comments (2)
  1. [§3] The definition of the overrun handling strategies in §3 could include a small table summarizing the supported policies and their state-update rules.
  2. [Introduction] Notation for the (m,k) window and the sequence set S(m,k) is introduced late; moving a compact definition to the introduction would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive feedback. We address each major comment below and will revise the manuscript to improve clarity and address the points raised.

read point-by-point responses

  1. Referee: [§4.1] §4.1, switched-system formulation: the stability theorem appears to rely on a common Lyapunov function over all admissible hit/miss sequences; this is a sufficient but potentially conservative condition that may not guarantee stability for every worst-case sequence permitted by the weakly-hard bound.

    Authors: The switched-system formulation in §4.1 encodes the weakly-hard (m,k) constraints as admissible switching sequences between hit and miss modes. The stability theorem applies a common quadratic Lyapunov function that is required to decrease for every possible transition permitted by the (m,k) bound. This yields a sufficient condition that guarantees stability for all admissible sequences without enumerating them individually. While we agree that a common Lyapunov function can be conservative relative to sequence-dependent or multiple-Lyapunov-function approaches, the common function is deliberately chosen to provide a uniform certificate that holds uniformly over the entire admissible set. In the revision we will add a remark explicitly acknowledging this conservatism and outlining how less conservative certificates (e.g., multiple Lyapunov functions or dwell-time conditions) could be incorporated in future extensions. revision: yes

  2. Referee: [Experimental section] Experimental section, Furuta pendulum results: the reported outperformance lacks detail on how the specific overrun sequences were sampled or whether they exhaust the admissible set; without this, it is unclear whether the experiments stress-test the claimed guarantees.

    Authors: For the (m,k) pairs used in the Furuta pendulum experiments ((1,2) and (2,3)), the admissible sequences are small enough that we enumerated the complete set of sequences satisfying the weakly-hard bound; each controller was evaluated against every such sequence. For the larger illustrative cases we employed uniform random sampling over the admissible set (with the sampling procedure described in the supplementary material). We will revise the experimental section to state this explicitly, include the enumeration counts, and add a short description of the sampling algorithm so that readers can verify that the reported performance differences are obtained under exhaustive or representative coverage of the admissible set. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the weakly-hard controller synthesis framework

full rationale

The paper integrates the weakly-hard task model as an external input from prior literature and applies standard controller synthesis techniques (e.g., optimization-based design with stability constraints) to produce designs that are then validated on an external benchmark (Furuta pendulum). No derivation step reduces by construction to a fitted parameter renamed as prediction, no self-definitional loops appear in the equations, and no load-bearing claims rest solely on self-citations whose content is unverified. The central stability and performance guarantees are derived from the explicit incorporation of admissible overrun sequences rather than from tautological re-use of the outputs themselves. The framework remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only view yields no identifiable free parameters, axioms, or invented entities; the framework is described at a high level without explicit modeling assumptions.

pith-pipeline@v0.9.0 · 5435 in / 997 out tokens · 46415 ms · 2026-05-15T07:52:32.895487+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

61 extracted references · 61 canonical work pages

  1. [1]

    Ver- ifying weakly-hard real-time properties of traffic streams in switched net- works

    Leonie Ahrendts, Sophie Quinton, Thomas Boroske, and Rolf Ernst. Ver- ifying weakly-hard real-time properties of traffic streams in switched net- works. In30th Euromicro Conference on Real-Time Systems (ECRTS), volume 106 ofLIPIcs, pages 15:1–15:22, 2018

    work page 2018

  2. [2]

    Finite ready queues as a mean for overload reduction in weakly-hard real-time systems

    Leonie Ahrendts, Sophie Quinton, and Rolf Ernst. Finite ready queues as a mean for overload reduction in weakly-hard real-time systems. In International Conference on Real-Time Networks and Systems, pages 88–97, 2017

    work page 2017

  3. [3]

    Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, and Robert I. Davis. An empirical survey-based study into industry practice in real-time systems. In41st IEEE Real-Time Systems Sympo- sium (RTSS), pages 3–11, 2020

    work page 2020

  4. [4]

    Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, and Robert I. Davis. A comprehensive survey of industry practice in real-time systems.Real Time Systems, 58(3):358–398, 2022

    work page 2022

  5. [5]

    Antunes and Haiming Qu

    Duarte J. Antunes and Haiming Qu. Frequency-domain analysis of networked control systems modeled by Markov jump linear systems. IEEE Transactions on Control of Network Systems, 8(2):906–916, 2021

    work page 2021

  6. [6]

    Ben-Tal.Lectures on modern convex optimization

    A. Ben-Tal.Lectures on modern convex optimization. Number 2 in MPS-SIAM series on optimization. SIAM, Philadelphia, Pa., 2001

    work page 2001

  7. [7]

    Guillem Bernat, Alan Burns, and A. Liamosi. Weakly hard real-time systems.IEEE Transactions on Computers, 50:308–321, 2001

    work page 2001

  8. [8]

    Towards networked control systems with guaranteed stability: Using weakly hard real-time constraints to model the loss process

    Rainer Blind and Frank Allgöwer. Towards networked control systems with guaranteed stability: Using weakly hard real-time constraints to model the loss process. In54th IEEE Conference on Decision and Control (CDC), pages 7510–7515, 2015

    work page 2015

  9. [9]

    Boyd.Linear matrix inequalities in system and control theory

    Stephen P. Boyd.Linear matrix inequalities in system and control theory. Society for Industrial and Applied Mathematics, 1994

    work page 1994

  10. [10]

    Brandenburg

    Sergey Bozhko, Georg von der Brüggen, and Björn B. Brandenburg. Monte carlo response-time analysis. In42nd IEEE Real-Time Systems Symposium (RTSS), pages 342–355, 2021

    work page 2021

  11. [11]

    Handling system overloads: An empirical evaluation of deadline-miss handling strategies

    Tim Braun and Sebastian Altmeyer. Handling system overloads: An empirical evaluation of deadline-miss handling strategies. In31st IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 228–240, 2025

    work page 2025

  12. [12]

    Improved scheduling of control tasks

    Anton Cervin. Improved scheduling of control tasks. In11th Euromicro Conference on Real-Time Systems (ECRTS), pages 4–10, 1999

    work page 1999

  13. [13]

    Analysis of overrun strategies in periodic control tasks

    Anton Cervin. Analysis of overrun strategies in periodic control tasks. IFAC Proceedings Volumes, 38(1):219–224, 2005

    work page 2005

  14. [14]

    Control-scheduling codesign of real- time systems: The control server approach.Journal of Embedded Compututing, 1(2):209–224, 2005

    Anton Cervin and Johan Eker. Control-scheduling codesign of real- time systems: The control server approach.Journal of Embedded Compututing, 1(2):209–224, 2005

    work page 2005

  15. [15]

    Springer Science & Business Media, 2005

    Oswaldo Luiz Valle Costa, Marcelo Dutra Fragoso, and Ricardo Paulino Marques.Discrete-time Markov jump linear systems. Springer Science & Business Media, 2005

    work page 2005

  16. [16]

    Davis and Liliana Cucu-Grosjean

    Robert I. Davis and Liliana Cucu-Grosjean. A survey of probabilistic schedulability analysis techniques for real-time systems.Leibniz Trans- actions on Embedded Systems, 6(1):04:1–04:53, 2019

    work page 2019

  17. [17]

    Davis and Liliana Cucu-Grosjean

    Robert I. Davis and Liliana Cucu-Grosjean. A survey of probabilistic timing analysis techniques for real-time systems.Leibniz Transactions on Embedded Systems, 6(1):03:1–03:60, 2019

    work page 2019

  18. [18]

    A design methodology for weakly-hard real-time control.IFAC Proceedings Volumes, 41(2):10258–10264, 2008

    Mongi Ben Gaid, Daniel Simon, and Olivier Sename. A design methodology for weakly-hard real-time control.IFAC Proceedings Volumes, 41(2):10258–10264, 2008

    work page 2008

  19. [19]

    Structure- exploiting distributionally robust control of non-homogeneous Markov jump linear systems.IEEE Control Systems Letters, 8:3069–3074, 2024

    Melanie Gallant, Christoph Mark, Paolo Pazzaglia, Johannes von Keler, Laura Beermann, Kevin Schmidt, and Martina Maggio. Structure- exploiting distributionally robust control of non-homogeneous Markov jump linear systems.IEEE Control Systems Letters, 8:3069–3074, 2024

    work page 2024

  20. [20]

    Soft-constrained stochastic MPC of Markov jump linear systems: Application to real-time control with deadline overruns.IEEE Control Systems Letters, 9:1532– 1537, 2025

    Melanie Gallant, Christoph Mark, Paolo Pazzaglia, Johannes von Keler, Laura Beermann, Kevin Schmidt, and Martina Maggio. Soft-constrained stochastic MPC of Markov jump linear systems: Application to real-time control with deadline overruns.IEEE Control Systems Letters, 9:1532– 1537, 2025

    work page 2025

  21. [21]

    Analysis of networked con- trol systems with drops and variable delays.Automatica, 43(12):2054– 2059, 2007

    Matías García-Rivera and Antonio Barreiro. Analysis of networked con- trol systems with drops and variable delays.Automatica, 43(12):2054– 2059, 2007

    work page 2054

  22. [22]

    Design and validation of fault- tolerant embedded controllers

    Saurav Kumar Ghosh, Soumyajjit Dey, Dip Goswami, Daniel Mueller- Gritschneder, and Samarjit Chakraborty. Design and validation of fault- tolerant embedded controllers. InDesign, Automation & Test in Europe Conference & Exhibition (DATE), pages 1283–1288, 2018

    work page 2018

  23. [23]

    Branden- burg

    Arpan Gujarati, Mitra Nasri, Rupak Majumdar, and Björn B. Branden- burg. From iteration to system failure: Characterizing the fitness of periodic weakly-hard systems. In31st Euromicro Conference on Real- Time Systems (ECRTS), volume 133 ofLIPIcs, pages 9:1–9:23, 2019

    work page 2019

  24. [24]

    Hamdaoui and P

    M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m, k)-firm deadlines.IEEE Transactions on Computers, 44(12):1443–1451, 1995

    work page 1995

  25. [25]

    Bounding deadline misses in weakly-hard real-time systems with task dependencies

    Zain Alabedin Haj Hammadeh, Rolf Ernst, Sophie Quinton, Rafik Henia, and Laurent Rioux. Bounding deadline misses in weakly-hard real-time systems with task dependencies. InDesign, Automation & Test in Europe Conference & Exhibition (DATE), pages 584–589, 2017

    work page 2017

  26. [26]

    Ex- tending typical worst-case analysis using response-time dependencies to bound deadline misses

    Zain Alabedin Haj Hammadeh, Sophie Quinton, and Rolf Ernst. Ex- tending typical worst-case analysis using response-time dependencies to bound deadline misses. In14th International Conference on Embedded Software (EMSOFT), pages 10:1–10:10, 2014

    work page 2014

  27. [27]

    Weakly- hard real-time guarantees for earliest deadline first scheduling of inde- pendent tasks.ACM Transactions on Embedded Computing Systems, 18(6):121:1–121:25, 2020

    Zain Alabedin Haj Hammadeh, Sophie Quinton, and Rolf Ernst. Weakly- hard real-time guarantees for earliest deadline first scheduling of inde- pendent tasks.ACM Transactions on Embedded Computing Systems, 18(6):121:1–121:25, 2020

    work page 2020

  28. [28]

    Stability analysis for nonlinear weakly hard real-time control systems.IFAC- PapersOnLine, 53(2):2594–2599, 2020

    Michael Hertneck, Steffen Linsenmayer, and Frank Allgöwer. Stability analysis for nonlinear weakly hard real-time control systems.IFAC- PapersOnLine, 53(2):2594–2599, 2020

    work page 2020

  29. [29]

    Efficient stability analysis approaches for nonlinear weakly-hard real-time control systems.Automatica, 133:109868, 2021

    Michael Hertneck, Steffen Linsenmayer, and Frank Allgöwer. Efficient stability analysis approaches for nonlinear weakly-hard real-time control systems.Automatica, 133:109868, 2021

    work page 2021

  30. [30]

    Clara Hobbs, Bineet Ghosh, Shengjie Xu, Parasara Sridhar Duggirala, and Samarjit Chakraborty. Safety analysis of embedded controllers under implementation platform timing uncertainties.IEEE Transactions on Computer Aided Design of Integrated Circuits Systems, 41(11):4016– 4027, 2022

    work page 2022

  31. [31]

    System verification and runtime monitoring with multiple weakly-hard constraints.ACM Transactions on Cyber-Physical Systems, 7(3):1–28, July 2023

    Yi-Ting Hsieh, Tzu-Tao Chang, Chen-Jun Tsai, Shih-Lun Wu, Ching- Yuan Bai, Kai-Chieh Chang, Chung-Wei Lin, Eunsuk Kang, Chao Huang, and Qi Zhu. System verification and runtime monitoring with multiple weakly-hard constraints.ACM Transactions on Cyber-Physical Systems, 7(3):1–28, July 2023

    work page 2023

  32. [32]

    Analysis of networked control system with packet drops governed by (m,k)-firm constraint

    Ning Jia, Ye-Qiong Song, and Rui-Zhong Lin. Analysis of networked control system with packet drops governed by (m,k)-firm constraint. IFAC Proceedings Volumes, 38(2):63–70, 2005

    work page 2005

  33. [33]

    Experimenting with networked control software subject to faults

    Brindha Jeniefer Josephrexon and Martina Maggio. Experimenting with networked control software subject to faults. In61st IEEE Conference on Decision and Control (CDC), pages 1547–1552, 2022

    work page 2022

  34. [34]

    Prentice Hall, Upper Saddle River, New Jersey, 3rd edition, 2002

    Hassan Khalil.Nonlinear systems. Prentice Hall, Upper Saddle River, New Jersey, 3rd edition, 2002

    work page 2002

  35. [35]

    Kirsch and Ana Sokolova.The Logical Execution Time Paradigm, pages 103–120

    Christoph M. Kirsch and Ana Sokolova.The Logical Execution Time Paradigm, pages 103–120. Advances in Real-Time Systems. Springer Berlin Heidelberg, 2011

    work page 2011

  36. [36]

    Robust performance for switched systems with constrained switching and its application to weakly hard real-time control systems, 2024.arXiv:2411.08436

    Simon Lang, Marc Seidel, and Frank Allgöwer. Robust performance for switched systems with constrained switching and its application to weakly hard real-time control systems, 2024.arXiv:2411.08436

    work page arXiv 2024

  37. [37]

    Antsaklis

    Hai Lin and Panos J. Antsaklis. Stability and stabilizability of switched linear systems: A survey of recent results.IEEE Transactions on Automatic Control, 54(2):308–322, 2009

    work page 2009

  38. [38]

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

    Steffen Linsenmayer and Frank Allgöwer. Stabilization of networked control systems with weakly hard real-time dropout description. InIEEE 56th Conference on Decision and Control (CDC), pages 4765–4770, 2017

    work page 2017

  39. [39]

    Linear weakly hard real-time control systems: Time- and event-triggered sta- bilization.IEEE Transactions on Automatic Control, 66(4):1932–1939, 2021

    Steffen Linsenmayer, Michael Hertneck, and Frank Allgöwer. Linear weakly hard real-time control systems: Time- and event-triggered sta- bilization.IEEE Transactions on Automatic Control, 66(4):1932–1939, 2021

    work page 1932

  40. [40]

    Y ALMIP: a toolbox for modeling and optimization in MATLAB

    Johan Löfberg. Y ALMIP: a toolbox for modeling and optimization in MATLAB. In2004 IEEE International Conference on Robotics and Automation (ICRA), pages 284–289, 2004

    work page 2004

  41. [41]

    Control-system stability under consecutive deadline misses con- straints

    Martina Maggio, Arne Hamann, Eckart Mayer-John, and Dirk Ziegen- bein. Control-system stability under consecutive deadline misses con- straints. In32nd Euromicro Conference on Real-Time Systems (ECRTS), volume 165, pages 21:1–21:24, 2020

    work page 2020

  42. [42]

    Brandenburg

    Filip Markovi ´c, Georg von der Brüggen, Mario Günzel, Jian-Jia Chen, and Björn B. Brandenburg. A distribution-agnostic and correlation-aware analysis of periodic tasks. In45th IEEE Real-Time Systems Symposium (RTSS), pages 215–228, 2024

    work page 2024

  43. [43]

    Version 10.0.37, 2023

    MOSEK ApS.The MOSEK optimization toolbox for MATLAB manual. Version 10.0.37, 2023

    work page 2023

  44. [44]

    Stealthy com- putational delay attacks on control systems

    Talitha Nauta, Henrik Sandberg, and Martina Maggio. Stealthy com- putational delay attacks on control systems. InProceedings of the ACM/IEEE 16th International Conference on Cyber-Physical Systems (ICCPS), (with CPS-IoT Week 2025), pages 9:1–9:11, 2025

    work page 2025

  45. [45]

    DMAC: Deadline-miss-aware control.31st Euromicro Conference on Real-Time Systems (ECRTS), 2019

    Paolo Pazzaglia, Claudio Mandrioli, Martina Maggio, and Anton Cervin. DMAC: Deadline-miss-aware control.31st Euromicro Conference on Real-Time Systems (ECRTS), 2019

    work page 2019

  46. [46]

    Beyond the weakly hard model: Measuring the performance cost of deadline misses

    Paolo Pazzaglia, Luigi Pannocchi, Alessandro Biondi, and Marco Di Na- tale. Beyond the weakly hard model: Measuring the performance cost of deadline misses. In30th Euromicro Conference on Real-Time Systems (ECRTS), volume 106, pages 10:1–10:22, 2018

    work page 2018

  47. [47]

    To zero or to hold control inputs with lossy links?IEEE Transactions on Automatic Control, 54(5):1093–1099, 2009

    Luca Schenato. To zero or to hold control inputs with lossy links?IEEE Transactions on Automatic Control, 54(5):1093–1099, 2009

    work page 2009

  48. [48]

    Onℓ2-performance of weakly-hard real-time control systems.European Journal of Control, 80:101056, 2024

    Marc Seidel, Simon Lang, and Frank Allgöwer. Onℓ2-performance of weakly-hard real-time control systems.European Journal of Control, 80:101056, 2024

    work page 2024

  49. [49]

    Performance analysis for cone-preserving switched systems with constrained switching

    Marc Seidel, Richard Pates, and Frank Allgöwer. Performance analysis for cone-preserving switched systems with constrained switching. In 64th IEEE Conference on Decision and Control (CDC), pages 4101– 4106, 2025

    work page 2025

  50. [50]

    E. P. van Horssen, A. R. Baghban Behrouzian, D. Goswami, D. Antunes, T. Basten, and W. P. M. H. Heemels. Performance analysis and controller improvement for linear systems with (m, k)-firm data losses. In15th European Control Conference (ECC), pages 2571–2577, 2016

    work page 2016

  51. [51]

    J. J. C. van Schendel, M. C. F. Donkers, W. P. M. H. Heemels, and N. van de Wouw. On dropout modelling for stability analysis of networked control systems. In2010 American Control Conference (ACC), 2010

    work page 2010

  52. [52]

    Brandenburg

    Georg von der Brüggen, Nico Piatkowski, Kuan-Hsun Chen, Jian- Jia Chen, Katharina Morik, and Björn B. Brandenburg. Efficiently approximating the worst-case deadline failure probability under EDF. In42nd IEEE Real-Time Systems Symposium (RTSS), pages 214–226, 2021

    work page 2021

  53. [53]

    Stability and performance analysis of control systems subject to bursts of deadline misses

    Nils Vreman, Anton Cervin, and Martina Maggio. Stability and performance analysis of control systems subject to bursts of deadline misses. In33rd Euromicro Conference on Real-Time Systems (ECRTS), volume 196, pages 15:1–15:23, 2021

    work page 2021

  54. [54]

    Deadline-miss- adaptive controller implementation for real-time control systems

    Nils Vreman, Claudio Mandrioli, and Anton Cervin. Deadline-miss- adaptive controller implementation for real-time control systems. In 2022 IEEE 28th Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 13–26, May 2022

    work page 2022

  55. [55]

    WeaklyHard.jl: Scalable analysis of weakly-hard constraints

    Nils Vreman, Richard Pates, and Martina Maggio. WeaklyHard.jl: Scalable analysis of weakly-hard constraints. In28th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 228–240, 2022

    work page 2022

  56. [56]

    Stability of linear systems under extended weakly-hard con- straints.IEEE Control Systems Letters, 6:2900–2905, 2022

    Nils Vreman, Paolo Pazzaglia, Victor Magron, Jie Wang, and Martina Maggio. Stability of linear systems under extended weakly-hard con- straints.IEEE Control Systems Letters, 6:2900–2905, 2022

    work page 2022

  57. [57]

    Efficient system ver- ification with multiple weakly-hard constraints for runtime monitoring

    Shih-Lun Wu, Ching-Yuan Bai, Kai-Chieh Chang, Yi-Ting Hsieh, Chao Huang, Chung-Wei Lin, Eunsuk Kang, and Qi Zhu. Efficient system ver- ification with multiple weakly-hard constraints for runtime monitoring. InRuntime Verification, pages 497–516, 2020

    work page 2020

  58. [58]

    Stabilization of linear systems over networks with bounded packet loss.Automatica, 43(1):80–87, 2007

    Junlin Xiong and James Lam. Stabilization of linear systems over networks with bounded packet loss.Automatica, 43(1):80–87, 2007

    work page 2007

  59. [59]

    Shengjie Xu, Bineet Ghosh, Clara Hobbs, P. S. Thiagarajan, and Samarjit Chakraborty. Safety-aware flexible schedule synthesis for cyber-physical systems using weakly-hard constraints. In28th Asia and South Pacific Design Automation Conference (ASPDAC), page 46–51, 2023

    work page 2023

  60. [60]

    Improved deadline miss models for real-time systems using typical worst-case analysis

    Wenbo Xu, Zain Alabedin Haj Hammadeh, Alexander Kröller, Rolf Ernst, and Sophie Quinton. Improved deadline miss models for real-time systems using typical worst-case analysis. In27th Euromicro Conference on Real-Time Systems (ECRTS), pages 247–256, 2015

    work page 2015

  61. [61]

    Venkatesh, and Samarjit Chakraborty

    Anand Yeolekar, Supratik Chakraborty, R. Venkatesh, and Samarjit Chakraborty. Repairing control safety violations via scheduler patch synthesis. InProceedings of the ACM/IEEE 16th International Confer- ence on Cyber-Physical Systems (ICCPS), 2025

    work page 2025