Pages that link to "Item:Q892994"
From MaRDI portal
The following pages link to Combinatorial abstraction refinement for feasibility analysis of static priorities (Q892994):
Displaying 8 items.
- Schedulability analysis of a graph-based task model for mixed-criticality systems (Q255289) (← links)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917) (← links)
- Graph-based models for real-time workload: a survey (Q497995) (← links)
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs (Q779456) (← links)
- Combinatorial abstraction refinement for feasibility analysis of static priorities (Q892994) (← links)
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement (Q1698776) (← links)
- Safe Decomposition of Startup Requirements: Verification and Synthesis (Q5039507) (← links)
- (Q5089127) (← links)
