Nondeterministic Programs

  • Krzysztof R. Apt
  • Ernst-Rüdiger Olderog
Part of the Texts and Monographs in Computer Science book series (MCS)


Activating a deterministic program in a certain state will generate exactly one computation sequence. Often this level of detail is unnecessary, for example when two different computation sequences yield the same final state. The phenomenon that a program may generate more than one computation sequence from a given state is called nondeterminism.


Random Assignment Proof System Total Correctness Proof Outline Proof Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AO83]
    K.R. Apt and E.-R. Olderog. Proof rules and transformations dealing with fairness. Science of Computer Programming, 3: 65–100, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [AP86]
    K.R. Apt and G.D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33 (4): 724–767, October 1986.MathSciNetzbMATHGoogle Scholar
  3. [Apt84]
    K.R. Apt. Ten years of Hoare’s logic, a survey, part II: nondeter- minism Theoretical Computer Science, 28: 83–109, 1984.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [Bak80]
    J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall International, Englewood Cliffs, NJ, 1980.zbMATHGoogle Scholar
  5. [Cou77]
    P. Cousot. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Technical Report Rapport de Recherche No 88, Université Scientifique et Medicale de Grenoble, L.A. 7, 1977.Google Scholar
  6. [Dij75]
    E.W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18: 453–457, 1975.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [Dij76]
    E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976.zbMATHGoogle Scholar
  8. [Flo67]
    R. Floyd. Nondeterministic algorithms. Journal of the ACM, 14 (3): 636–644, 1967.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [FP83]
    M.J. Fischer and M.S. Paterson. Storage requirements for fair scheduling. Information Processing Letters, 17: 249–250, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [Fra86]
    N. Francez. Fairness. Springer-Verlag, New York, 1986.zbMATHCrossRefGoogle Scholar
  11. [Gri81]
    D. Gries. The Science of Programming. Springer-Verlag, New York, 1981.zbMATHCrossRefGoogle Scholar
  12. [Gri82]
    D. Gries. A note on a standard strategy for developing loop invariants and loops. Science of Computer Programming, 2: 207–214, 1982.MathSciNetzbMATHCrossRefGoogle Scholar
  13. [Knu68]
    D.E. Knuth. The Art of Computer Programming. Vol.1: Fundamental Algorithms. Addison - Wesley, Reading, Mass., 1968.zbMATHGoogle Scholar
  14. [Kön27]
    D. König. Über eine Schlußweise aus dem Endlichen ins Unendliche. Acta Litt. Ac. Sci., 3: 121–130, 1927.zbMATHGoogle Scholar
  15. [Lau71]
    P.E. Lauer. Consistent formal theories of the semantics of programming languages. Technical Report 25.121, IBM Laboratory Vienna, 1971.Google Scholar
  16. [0A88]
    E.-R. Olderog and K.R. Apt. Fairness in parallel programs, the transformational approach. ACM Transactions on Programming Languages and Systems, 10: 420–455, 1988.CrossRefGoogle Scholar
  17. [Par79]
    D. Park. On the semantics of fair parallelism. In D. Bjorner, editor, Proceedings of Abstract Software Specifications, pages 504–526, New York, 1979. Lecture Notes in Computer Science 86, Springer-Verlag.Google Scholar
  18. [Tar55]
    A. Tarski. A lattice-theoretic fixpoint theorem and its applications. Pacific J. Math, 5: 285–309, 1955.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1991

Authors and Affiliations

  • Krzysztof R. Apt
    • 1
  • Ernst-Rüdiger Olderog
    • 2
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Department of Computer ScienceUniversity of OldenburgOldenburgGermany

Personalised recommendations