Add to ORKGThis paper shows how the feasibility of scheduling a realtime program consisting of a number of parallel processes (tasks) can be proved as a step in the refinement of the program from its specification. Verification of this step of refinement makes formal use of methods and results from real-time scheduling theory
International audienceThe use of computers to control safety-critical real-time functions has increa...
The problem of schedulability analysis of a set of real time programs form a NP complete problem. Th...
In this chapter we consider the problem of scheduling real-time applications upon multiprocessors, o...
This paper shows how the feasibility of scheduling a real-time program consisting of a number of par...
AbstractA real-time program can be developed by refining a specification into program code. Verifica...
A real-time program can be developed by refining a specification into program code. Verification of ...
We show how real-time schedulability tests and program refinement rules can be integrated to create ...
Work on the formal description and analysis of real-time systems has followed two paths. On one side...
We present several formal program refinement rules for designing multi-tasking programs with hard re...
Important classical scheduling theory results for real-time computing are identified. Implications o...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
Imprecise computation and parallel processing are two techniques for avoiding timing faults and tole...
A real-time system is typically a concurrent (or distributed) system whose computations and actions ...
In real-time systems, the basic criteria are to satisfy both timeliness and correctness of real-time...
International audienceThe use of computers to control safety-critical real-time functions has increa...
The problem of schedulability analysis of a set of real time programs form a NP complete problem. Th...
In this chapter we consider the problem of scheduling real-time applications upon multiprocessors, o...
This paper shows how the feasibility of scheduling a real-time program consisting of a number of par...
AbstractA real-time program can be developed by refining a specification into program code. Verifica...
A real-time program can be developed by refining a specification into program code. Verification of ...
We show how real-time schedulability tests and program refinement rules can be integrated to create ...
Work on the formal description and analysis of real-time systems has followed two paths. On one side...
We present several formal program refinement rules for designing multi-tasking programs with hard re...
Important classical scheduling theory results for real-time computing are identified. Implications o...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to...
Imprecise computation and parallel processing are two techniques for avoiding timing faults and tole...
A real-time system is typically a concurrent (or distributed) system whose computations and actions ...
In real-time systems, the basic criteria are to satisfy both timeliness and correctness of real-time...
International audienceThe use of computers to control safety-critical real-time functions has increa...
The problem of schedulability analysis of a set of real time programs form a NP complete problem. Th...
In this chapter we consider the problem of scheduling real-time applications upon multiprocessors, o...