Validation temporelle de systèmes de tâches temps-réel strictes à durée variables à l'aide de langages rationnels

Abstract

16 pagesInternational audiencewe show that real-time systems composed of both periodic and sporadic interdependents tasks wich CPU time is not fixed can be validated from a methodology based on rational languages. This property leads to the cyclicity of the scheduling sequences for such systems