Model-Based Analysis of Contract-Based Real-Time Scheduling

Authors:
Georgiana Macariu;Vladimir Creţu
Affiliations:
Computer Science and Engineering Department, Politehnica University of Timisoara, Timisoara, Romania;Computer Science and Engineering Department, Politehnica University of Timisoara, Timisoara, Romania
Venue:
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Year:
2009

Citing 8
Cited 0

A theory of timed automata

Theoretical Computer Science
What's decidable about hybrid automata?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Impressive Power of Stopwatches

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A methodology for designing hierarchical scheduling systems

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors

ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Task automata: Schedulability, decidability and undecidability

Information and Computation
Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking

SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply automata theory to analyze the schedulability of real-time component-based applications running on uniform multi-proces-sor platforms. The resource requirements of each application or application component are specified in a service contract resulting a hierarchy of contracts. As we are interested in determining the schedulability of such applications, this hierarchy of contracts is mapped to a hierarchical scheduling strategy. We use model checking and transform the schedulability analysis problem into a reachability checking of a timed automata model of the service contracts.