An intuitive formal proof for deadline driven scheduler (Q5945840): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A calculus of durations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Duration calculus: Logical foundations / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:35, 3 June 2024
scientific article; zbMATH DE number 1657699
Language | Label | Description | Also known as |
---|---|---|---|
English | An intuitive formal proof for deadline driven scheduler |
scientific article; zbMATH DE number 1657699 |
Statements
An intuitive formal proof for deadline driven scheduler (English)
0 references
14 October 2001
0 references
deadline driven scheduler
0 references
duration calculus
0 references