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

DOI10.4230/LIPICS.ECRTS.2019.9MaRDI QIDQ5089107zbMATH OpenOpenAlexFDO

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

Publication date 18 July 2022

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

zbMATH Keywords

MTTF/FIT analysisreliability analysisweakly-hard constraints

Mathematics Subject Classification ID

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

Cites work

• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• Basic Linear Algebra Subprograms for Fortran Usage
• Beyond the weakly hard model: measuring the performance cost of deadline misses
• Dynamic scheduling for networked control systems
• Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
• Formal verification of weakly-hard systems
• scientific article; zbMATH DE number 6009889 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Quantifying the resiliency of fail-operational real-time networked control systems
• Reliability of a consecutive k-out-of-r-from-n:F system
• Timing analysis of real-time communication under electromagnetic interference
• Weakly hard real-time systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089107)