Non-determinism is widely recognized as a valuable tool for program development [Dijkstra 1976]. It appears also as the natural environment for the , evolution of systems of parallel processes; sequential implementation of such systems through non-deterministically simulating their distributed behaviour can be an effective programming technique [Guerreiro 1981, 1983b]. Furthermore, the concept ...

We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice. Cons-freeness roughly means that data constructors cannot occur in function bodies and all manipulation of storage space thus has to happen indirectly using the call s...

Ensuring the correctness of a distributed system is an important challenge. Previously, two interpretations of correctness have been proposed: the first interpretation is about determinism, saying that all infinite fair computation traces produce the same output; and, the second interpretation is a confluence notion, saying that all finite computation traces can still be extended to produce the...

Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization by taking advantage of quantum entanglement [2]. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of globa...

The fundamental questions of computation theory are related to the relative power of determinism, nondeterminism, and randomization. The famous P vs. NP problem is not the only one of main interest. The class of practically solvable algorithmic problems is not specified by deterministic polynomial time (P) anymore, but by bounded-error polynomial time algorithms. Hence, the comparison of the ef...

In this paper we propose a stochastic broadcast π-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant. Therefore, there is no need to determine the joint synchronization rates. We also take immediate transitions into account which is useful to model behaviors with no impact on the temporal properties of a system. Since...

In this paper we study the non-determinism between the inference rules of the lazy narrowing calculus lnc (Middeldorp et al., 1996). We show that all non-determinism can be removed without losing the important completeness property by restricting the underlying term rewriting systems to left-linear confluent constructor systems and interpreting equality as strict equality. For the subclass of o...

The quantum model of computation not only o ers entirely new ways to manipulate information but also allows information process ing tasks to be formulated in unconventional genuine quantum me chanical terms We show that the task of distinguishing among en tangled quantum states combines entanglement and non determinism in a way that makes the quantum solution impossible to simulate on any class...

In this paper, we consider the problem of synthesizing low-complexity safety controllers for incrementally stable switched systems. For that purpose, we establish a new approximation result for the computation of symbolic models that are approximately bisimilar to a given switched system. The main advantage over existing results is that it allows us to design quantized switching controllers for...