Combinatorial abstraction refinement for feasibility analysis of static priorities

DOI10.1007/S11241-015-9220-5zbMATH Open1343.68037OpenAlexW2059655552MaRDI QIDQ892994FDOQ892994

Authors: Martin Stigge, Wang Yi 

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

Recommendations

• scientific article; zbMATH DE number 1830720
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
• Schedulability analysis of fixed-priority systems using timed automata
• Static analysis of embedded real-time concurrent software with dynamic priorities

zbMATH Keywords

real-timeschedulability analysisabstraction refinementstatic prioritiescombinatorial explosion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Schedulability analysis of a graph-based task model for mixed-criticality systems
• Safe decomposition of startup requirements: verification and synthesis
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling
• A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Graph-based models for real-time workload: a survey
• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement

Uses Software

• Dagger

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

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