A determinism test is proposed based on the well-known method of the surrogate data. Assuming predictability to be a signature of determinism, the proposed method checks for intracycle (e.g., short-term) determinism in the pseudoperiodic time series for which standard methods of surrogate analysis do not apply. The approach presented is composed of two steps. First, the data are preprocessed to...

This paper takes a critical look at the benefits provided by state-of-the-art deterministic execution techniques. Specifically, we look at four applications of deterministic execution: debugging, fault-tolerant replication, testing, and security. For each application, we discuss what an ideal system would provide, and then look at how deterministic systems compare to the ideal. Further, we disc...

The article puts forward a branching-style framework for the analysis of determinism and indeterminism of scientific theories, starting from the core idea that an indeterministic system is one whose present allows for more than one alternative possible future. We describe how a definition of determinism stated in terms of branching models supplements and improves current treatments of determini...

The notion of deterministic execution of concurrent systems has appeared in many guises throughout Edward A. Lee’s œuvre, but few really grasp how powerful, important, subtle, and flexible the concept really is. Determinism can be thought of as an abstraction boundary that delineates where control is passed from a system designer to the implementation. This paper surveys some of the many forms ...

In standard computation, non-determinism is used for specifying programs’ behaviour, without having to specify details of implementation. In quantum computation, non-determinism is either meant to be “classical” probabilism or it is not considered at all, since quantum computation is the physical theory of computation and thus it does not deal with non-implementable features. In this work we wi...

State-machine-based replication is an effective way to increase the availability and dependability of mission-critical applications. However, all practical applications contain some degree of non-determinism. Consequently, ensuring strong replica consistency in the presence of application non-determinism has been one of the biggest challenges in building dependable distributed systems. In this ...

In this contribution, we reconsider the notion of determinism for max-plus automata by including quantitative aspect in its definition. A determinization procedure adapted to so-called weight-determinism is proposed. The motivation generalize results based on automata.