Task Graph Analysis
Task Graph Analysis is a formal method within Worst-Case Execution Time Analysis that models program execution as a directed graph to capture task dependencies, control flow, and resource contention, enabling precise computation of worst-case timing bounds.
118
Publications
5.6K
Citations
334
Authors
134
Institutions
Publications per year
2017–2026
19
118
Robert P. Dick, David L. Rhodes, Wayne Wolf · 1998 · 779 citations
Robert P. Dick, David L. Rhodes · 2002 · 464 citations
1–5 of 118
334
5
h-index
5
h-index
4
h-index
3
h-index
2
h-index
1–5 of 334
134
Princeton University
Princeton, United States
7 h-index
14 publications
3.8K citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
7 publications
245 citations
NXP (Netherlands)
Eindhoven, The Netherlands
5 h-index
5 publications
119 citations

University of Twente
Enschede, The Netherlands
4 h-index
5 publications
105 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
4 h-index
4 publications
319 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
4 h-index
8 publications
171 citations
Politecnico di Milano
Milan, Italy
3 h-index
10 publications
146 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
5 publications
445 citations
1–8 of 134
TPDS · 4 publications · 449 citations
4
h-index
2 publications · 40 citations
2
h-index
1 publications · 10 citations
2
h-index
2 publications · 65 citations
2
h-index
1 publications · 16 citations
1
h-index
1–5