Analysis of Preemptive Periodic Real-Time Systems Using the (Max,PLus) Algebra With Applications in Robotics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Control Systems Technology Year : 2002

Analysis of Preemptive Periodic Real-Time Systems Using the (Max,PLus) Algebra With Applications in Robotics

François Baccelli
Bruno Gaujal
Daniel Simon

Abstract

In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controller, using Marked Graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronisation constraints and is not limited to a particular scheduling policy. || Dans cet article nous présentons le modèle graphe d'événement d'un système de tâches périodiques temps-réel avec des priorités fixes, de la préemption et des synchronisations, exécutées par un controleur robot. Ensuite, en utilisant l'algèbre (max,plus)
No file

Dates and versions

inria-00100900 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100900 , version 1

Cite

François Baccelli, Bruno Gaujal, Daniel Simon. Analysis of Preemptive Periodic Real-Time Systems Using the (Max,PLus) Algebra With Applications in Robotics. IEEE Transactions on Control Systems Technology, 2002, 10 (3), pp.268-380. ⟨inria-00100900⟩
177 View
0 Download

Share

Gmail Facebook X LinkedIn More