A hard-real-time embedded system is characterized by a collection of tasks (called a
taskset), where each task executes repeatedly with some pre-specified rate. We refer to such …

We consider a model of reactive real-time systems in which tasks are enabled in reaction to
external events or executions of other tasks, and enabled tasks are scheduled according to …

Real time software is increasingly used in safety critical embedded systems. For these real
time systems, tasks have timing requirements (ie, deadlines) that must be met for correct …

A weakly-hard real-time system is a system that can tolerate a bounded number of timing
violations. There have been various assumptions made by prior work on handling deadline …

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time
systems. Such systems have often the need to execute not only application tasks but also …

Traditionally, real-time systems have based their design and execution on barely dynamic
models to ensure, since design time, the temporal guarantees in the execution of their …

The reliability of safety-critical embedded real-time system depends partly on that of the
system design. Because of this, formal methods have been adopted in the design phase of …

One of the most widely used static priority scheduling algorithms for hard real-time systems
serving periodic tasks is the rate-monotonic algorithm. It benefits from a rich theoretical …

Task scheduling for reactive real time systems is adifficult problem due to tight constraints
that theschedule must satisfy. A static priority schemeis proposed here that can be formally …

The timeliness of task execution in real-time systems is addressed. Specifically, the dynamic
scheduling of tasks with well-defined timing constraints is investigated. A dynamic …