Nondeterminism
Nondeterminism is a computational behavior in process algebra wherein a system may choose among multiple possible next actions without specified probabilities or deterministic selection criteria, distinguishing it from probabilistic and deterministic transition models.
356
Publications
17.3K
Citations
623
Authors
280
Institutions
Publications per year
2017–2026
27
Parents
356
What's Decidable about Hybrid Automata?
Thomas A. Henzinger, Peter W. Kopke, Anuj Puri et al. · Journal of Computer and System Sciences · 1998 · 675 citations · Full text
What's decidable about hybrid automata?
Thomas A. Henzinger, Peter W. Kopke, Anuj Puri et al. · 1995 · 521 citations · Full text
The method of forced enumeration for nondeterministic automata
Acta Informatica · 1988 · 384 citations
Hypertableau Reasoning for Description Logics
2007 · 353 citations
1–5 of 356
623
7
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 623
280
University of California, Berkeley
Berkeley, United States
10 h-index
25 publications
3.9K citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
10 publications
492 citations

The University of Queensland
Brisbane, Australia
7 h-index
15 publications
489 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
20 publications
885 citations

University of Edinburgh
Edinburgh, United Kingdom
7 h-index
8 publications
510 citations

Pennsylvania State University
State College, United States
7 h-index
9 publications
368 citations
University of California San Diego
San Diego, United States
6 h-index
7 publications
2K citations
University of Cambridge
Cambridge, United Kingdom
6 h-index
7 publications
187 citations
1–8 of 280
31 publications · 1.6K citations
20
h-index
ENTCS · 12 publications · 398 citations
12
h-index
9 publications · 2.4K citations
9
h-index
8 publications · 291 citations
8
h-index
8 publications · 642 citations
8
h-index
1–5