Replication is crucial to achieve high availability distributed systems. However, non-determinism introduces consistency problems between replicas. Transactions are very well suited to maintain consistency, and by integrating them with replication, support for non-deterministic execution in replicated environments can be achieved. This paper presents an approach where a passively replicated tra...

We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Par...

Multicore architectures are becoming prevalent and bring many programming challenges. One of the biggest challenges is non-determinism: the output of a program depends not only on the input, but also on the scheduling choices taken by the operating system. My interests lie in investigating techniques and tools that aid determinism, such as libraries and compilers that provide deterministic cons...

We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch 55], which allow non-deterministic choice between probability distributions. These systems can be decomposed into a collection of \computation trees" which arise by resolving the non-deterministic, but not probabilistic, choices. The presence of non-determinism means that certain liveness properties ...

The aims of this chapter are to review some aspects of determinism that are familiar to physicists but are little discussed in the philosophical literature and to show how these aspects connect determinism to issues about symmetries in physics, the structure and ontological status of spacetime, predictability, and computability. It will emerge that in some respects determinism is a robust doctr...

Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership problem is NP-complete. This implies that this family REC is intrinsically non-deterministic. The natural and immediate definition of unambiguity co...

Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursiontheoretic manner. Here we emphasize the connection between the structure of the recursion schemes and the underlying models of computation. 1998 ACM Subject Classification F.4.1 Mathematical Logic, F.1.1 Models of Computation, F.1.2 Modes of Computation, F.1.3 Complexity Measures and Classes

We consider the representational state complexity of unranked tree automata. The bottomup computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic defi...