A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A formal proof of the deadline driven scheduler in PPTL axiomatic system |
scientific article; zbMATH DE number 6351437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A formal proof of the deadline driven scheduler in PPTL axiomatic system |
scientific article; zbMATH DE number 6351437 |
Statements
A formal proof of the deadline driven scheduler in PPTL axiomatic system (English)
0 references
6 October 2014
0 references
theorem proving
0 references
projection temporal logic
0 references
deadline driven scheduler
0 references
real-time system
0 references
0 references
0.841252326965332
0 references
0.76848304271698
0 references
0.7499033808708191
0 references
0.7481150031089783
0 references
0.734990119934082
0 references
