A program construct is proposed, for which the assumption of bounded nondeterminism is not natural. It is shown that the simple approach of taking the powerdomain of the flat cpo does not produce a correct semantics for programs in which nondeterminism is unbounded. The powerdomain approach is then extended to computation paths, resulting is an essentially operational semantics for programs of unbounded nondeterminism.

Additional Metadata
Persistent URL dx.doi.org/10.1007/3-540-10003-2_59
Conference European Conference on Numerical Mathematics and Advanced Applications
Back, R.J.R. (1980). Semantics of unbounded nondeterminism. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 51–63). doi:10.1007/3-540-10003-2_59