Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Nondeterministic algorithm

Known as: Non-deterministic algorithm 
In computer science, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
This paper describes a major new release of the PRISMprobabilistic model checker, adding, in particular, quantitative… Expand
  • figure 1
  • figure 2
Highly Cited
2002
Highly Cited
2002
On-chip micronetworks, designed with a layered methodology, will meet the distinctive challenges of providing functionally… Expand
  • figure 1
Highly Cited
2002
Highly Cited
2002
Recent advances in miniaturization and low-cost, low-power design have led to active research in large-scale networks of small… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1996
Highly Cited
1996
Symbolic model checking is a powerful formal specification and verification method that has been applied successfully in several… Expand
Highly Cited
1995
Highly Cited
1995
The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic… Expand
Highly Cited
1990
Highly Cited
1990
  • E. Emerson
  • Handbook of Theoretical Computer Science, Volume…
  • 1990
  • Corpus ID: 6062082
Publisher Summary This chapter discusses temporal and modal logic. The chapter describes a multiaxis classification of systems of… Expand
Highly Cited
1987
Highly Cited
1987
The paper studies the control of a class of discrete event processes, i.e., processes that are discrete, asynchronous and… Expand
  • figure 11.1
  • figure 11.2
  • figure 11.3
  • figure 11.4
  • figure 11.5
Highly Cited
1982
Highly Cited
1982
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations… Expand
Highly Cited
1980
Highly Cited
1980
  • R. Milner
  • Lecture Notes in Computer Science
  • 1980
  • Corpus ID: 27047741
0. Introduction.- 1. Experimenting on nondeterministic machines.- 2. Synchronization.- 3. A case study in synchronization and… Expand
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand