Combinatorial abstraction refinement for feasibility analysis of static priorities

DOI10.1007/s11241-015-9220-5zbMath1343.68037OpenAlexW2059655552MaRDI QIDQ892994

Wang Yi, Martin Stigge

Publication date: 13 November 2015

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-015-9220-5

zbMATH Keywords

real-timeschedulability analysisabstraction refinementstatic prioritiescombinatorial explosion

Mathematics Subject Classification ID

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

Related Items (8)

Safe Decomposition of Startup Requirements: Verification and Synthesis ⋮ Combinatorial abstraction refinement for feasibility analysis of static priorities ⋮ Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement ⋮ Computing periodic request functions to speed-up the analysis of non-cyclic task models ⋮ Graph-based models for real-time workload: a survey ⋮ Unnamed Item ⋮ A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs ⋮ Schedulability analysis of a graph-based task model for mixed-criticality systems

Uses Software

• Dagger

Cites Work

• Unnamed Item
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
• Task automata: Schedulability, decidability and undecidability
• Automatically Refining Abstract Interpretations
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Combinatorial abstraction refinement for feasibility analysis of static priorities