Formal verification of weakly-hard systems

DOI10.1145/3302504.3311811OpenAlexW2937876711MaRDI QIDQ5239237FDOQ5239237

Authors:

Publication date: 22 October 2019

Published in: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3302504.3311811

Recommendations

• Verifying weakly-hard real-time properties of traffic streams in switched networks
• Constraint specification of weakly hard real-time systems
• Scheduling algorithms based on weakly hard real-time constraints
• Formal verification of discrete real-time systems
• Budgeting under-specified tasks for weakly-hard real-time systems

zbMATH Keywords

formal verificationsafetyweakly-hard

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cited In (3)

• From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems
• Formal verification for non-formalists
• Efficient stability analysis approaches for nonlinear weakly-hard real-time control systems

This page was built for publication: Formal verification of weakly-hard systems

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