Task automata: Schedulability, decidability and undecidability (Q2643078)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5182186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Task automata: Schedulability, decidability and undecidability |
scientific article; zbMATH DE number 5182186 |
Statements
Task automata: Schedulability, decidability and undecidability (English)
0 references
23 August 2007
0 references
real time systems
0 references
schedulability analysis
0 references
timed automata
0 references
modeling and verification
0 references
0.93073684
0 references
0.8837008
0 references
0.8720999
0 references
0.8671848
0 references
0 references
0.8654611
0 references
0.8654611
0 references
0 references
