From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems

DOI10.4230/LIPIcs.ECRTS.2019.9OpenAlexW2964663026MaRDI QIDQ5089107

Arpan Gujarati, Björn B. Brandenburg, Rupak Majumdar, Mitra Nasri

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/lipics.ecrts.2019.9

zbMATH Keywords

reliability analysisMTTF/FIT analysisweakly-hard constraints

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Timing analysis of real-time communication under electromagnetic interference
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
• Dynamic scheduling for networked control systems
• Reliability of a consecutive k-out-of-r-from-n:F system
• Basic Linear Algebra Subprograms for Fortran Usage
• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• Weakly hard real-time systems
• Quantifying the Resiliency of Fail-Operational Real-Time Networked Control Systems
• Formal verification of weakly-hard systems

This page was built for publication: From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems