• 1 Laboratoire d'Informatique et d'Automatique pour les Systèmes [LIAS [Poitiers]]
• 2 Systèmes Embarqués Temps Réel
• 3 Laboratoire d'informatique et d'automatique pour les systèmes [EA 6315] [LIAS [Poitiers]]

We consider hard real-time systems composed of periodic tasks and of an aperiodic flow. Each task, either periodic or aperiodic, has a firm deadline. An aperiodic task is accepted within the system only if it can be completed before its deadline, without causing temporal failures for the periodic tasks or for the previously accepted aperiodic tasks. We propose an acceptance test, linear in the number of pending accepted aperiodic tasks. This protocol can be used provided the idle slots left by the periodic tasks are fairly distributed. We then propose a model-driven approach, based on Petri nets, to produce schedules with a fair distribution of the idle slots for systems of non independent periodic tasks.