Reachability Games
Reachability Games is a subclass of stochastic games in which the primary objective is to reach a designated set of target states, distinguishing it from other stochastic games by focusing on qualitative reachability goals rather than quantitative payoff maximization.
58
Publications
1.6K
Citations
110
Authors
64
Institutions
Publications per year
2017–2026
13
Parents
58
Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman · Theoretical Computer Science · 2007 · 139 citations
Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman · 2002 · 95 citations
Optimal strategies for testing nondeterministic systems
Lev Nachmanson, Margus Veanes, Wolfram Schulte et al. · 2004 · 73 citations
1–5 of 58
110
Institute of Science and Technology Austria, Austria
10 publications · 330 citations
9
h-index
8
h-index
7
h-index
5
h-index
4
h-index
1–5 of 110
64

Centre National de la Recherche Scientifique
Paris, France
9 h-index
14 publications
354 citations
University of California, Santa Cruz
Santa Cruz, United States
8 h-index
11 publications
404 citations
University of California, Berkeley
Berkeley, United States
7 h-index
12 publications
500 citations
Institute of Science and Technology Austria
Klosterneuburg, Austria
6 h-index
8 publications
253 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
5 h-index
5 publications
301 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
5 h-index
9 publications
213 citations

Masaryk University
Brno, Czechia
5 h-index
14 publications
347 citations

University of Toronto
Toronto, Canada
4 h-index
4 publications
89 citations
1–8 of 64
5 publications · 106 citations
5
h-index
Repository · 4 publications · 60 citations
4
h-index
Repository · 3 publications · 54 citations
3
h-index
LMCS · 3 publications · 59 citations
3
h-index
2 publications · 36 citations
2
h-index
1–5