This paper shows how we can use a logical formalism, a formal speciication language, to specify parts of a real-time kernel. The formalism is based on rst order logic, without special features for real-time purposes.
A practical condition is presented for feasibility of dynamic scheduling without preemption in uniprocessor real-time systems. For a task b, let r:b, d:b, and e:b be the release time, the deadline, and the maximal execution time, respectively. Let ub be an upper bound for the execution times of all tasks under consideration. For a set of tasks B, and for… (More)
In this paper a concept of the kernel, i.e., the time critical part of a real time operating system and its dedicated co-processor, especially tailored for embedded applications, are presented. The co-processor acts as a system controller and operates in conjunction with one or more conventional processors in hard real time environments. It is composed of… (More)