Pages that link to "Item:Q2464934"
From MaRDI portal
The following pages link to WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model (Q2464934):
Displaying 6 items.
- Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737) (← links)
- Schedulability analysis of timed regular tasks by under-approximation on WCET (Q1660771) (← links)
- Regular Geometrical Languages and Tiling the Plane (Q3073623) (← links)
- AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL (Q3395146) (← links)
- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (Q3602802) (← links)
- Geometrical Regular Languages and Linear Diophantine Equations (Q5200085) (← links)