Constraint specification of weakly hard real-time systems
From MaRDI portal
Recommendations
- Scheduling algorithms based on weakly hard real-time constraints
- Optimal control of discrete event systems with weakly hard real-time constraints
- A weakly hard real-time schedule algorithm based on cutting down
- Budgeting under-specified tasks for weakly-hard real-time systems
- scientific article; zbMATH DE number 53319
Cited in
(8)- Optimizing path real-time logic for unified real-time system
- Scheduling algorithms based on weakly hard real-time constraints
- scientific article; zbMATH DE number 1726638 (Why is no real title available?)
- Budgeting under-specified tasks for weakly-hard real-time systems
- A weakly hard real-time schedule algorithm based on cutting down
- Verifying weakly-hard real-time properties of traffic streams in switched networks
- Formal verification of weakly-hard systems
- Dynamic analysis of a fractional-order rumor spreading model with double time delay under higher-order interactions
This page was built for publication: Constraint specification of weakly hard real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431056)
