Copyright © 2003 Elsevier B.V. All rights reserved.
Scheduling hard sporadic tasks with regular languages and generating functions
Available online 13 November 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we consider offline validation of hard real-time systems composed of both periodic and sporadic tasks, embedded on centralized multi-processor architectures. To model hard real-time systems, we use untimed finite automata: each accepted word is a valid operational behavior of the periodic component of the system. Then, by associating generating functions with edges of the automaton, we give a modular decisional technique to decide the feasibility of sporadic tasks.
Author Keywords: Hard real-time systems; Finite automata; Generating functions; Operational validation






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






