Computational Tree Logic
Computational Tree Logic is a branching-time temporal logic used in formal verification, distinguished from linear-time logics by its ability to express properties over tree-structured computational paths through quantification over future states.
135
Publications
4.3K
Citations
369
Authors
187
Institutions
Publications per year
2017–2026
20
135
Multi-robot planning : a timed automata approach
Michael Melholt Quottrup, Thomas Bak · 2004 · 105 citations
1–5 of 135
369
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 369
187

Imperial College London
London, United Kingdom
7 h-index
12 publications
289 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
6 h-index
16 publications
281 citations

Shaanxi Normal University
Xi'an, China
5 h-index
13 publications
524 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
6 publications
121 citations

Xidian University
Xi'an, China
3 h-index
3 publications
288 citations
Institute of Software
Beijing, China
3 h-index
3 publications
82 citations
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
3 publications
77 citations

University of Milan
Milan, Italy
3 h-index
9 publications
122 citations
1–8 of 187
4 publications · 97 citations
4
h-index
ENTCS · 4 publications · 106 citations
4
h-index
3 publications · 159 citations
3
h-index
TSE · 3 publications · 90 citations
3
h-index
PAGEOPH · 2 publications · 243 citations
3
h-index
1–5