Related papers: Constraints on Chronologies
Testing for causality between events in distributed executions is a fundamental problem. Vector clocks solve this problem but do not scale well. The probabilistic Bloom clock can determine causality between events with lower space, time,…
We discuss the usual account of causal structure that relies on the temporal precedence constraint between cause-effect pairs. In particular, we consider the subtle interplay between local and global characters of time and causality encoded…
We reformulate Classical Mechanics as a timeless relativistic theory. Readers are introduced to a new class of reference systems, the binate frames, where physical events are identified with four position-coordinates -- no clocks are used.…
There exist several approaches that investigate the connectedness of spacetime events through solutions of the Lorentz force equation. These approaches separate into three categories, that consider different equations. We clarify the…
This article revisits the historiography of the problem of inertial frames. Specifically, the case of the twins in the clock paradox is considered to see that some resolutions implicitly assume inertiality for the non-accelerating twin. If…
Rescheduling problems arise in a variety of situations where a previously planned schedule needs to be adjusted to deal with unforeseen events. A common problem is the arrival of new orders, i.e. jobs, which have to be integrated into the…
I explain in what sense the structure of space and time is probably vague or indefinite, a notion I define. This leads to the mathematical representation of location in space and time by a vague interval. From this, a principle of…
I present a brief review on space and time in different periods of physics, and then talk on the nature of space and time from physical arguments. I discuss the ways to test such a new perspective on space and time through searching for…
A procedure for the evaluation of correlators of any order in a reasonable computer time is presented. Connection between correlators and fluctuations of the event mean values of observables is discussed. Extension of the procedure to…
I present an analysis of the physical assumptions needed to obtain the metric structure of space-time. For this purpose I combine the axiomatic approach pioneered by Robb with ideas drawn from works on Weyl's "Raumproblem". The concept of a…
In this note we discuss the possibility to define a space-time with a DSR based approach. We show that the strategy of defining a non linear realization of the Lorentz symmetry with a consistent vector composition law cannot be reconciled…
After a review of the chrono-geometrical structure of special relativity, where the definition of the instantaneous 3-space is based on the observer-dependent convention for the synchronization of distant clocks, it is shown that in a class…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
The bloom clock is a space-efficient, probabilistic data structure designed to determine the partial order of events in highly distributed systems. The bloom clock, like the vector clock, can autonomously detect causality violations by…
A model of discrete space-time is presented which is, in a sense, both Lorentz invariant and has no restriction on the relative velocity between particles (except v < c). The space-time has an inbuilt indeterminacy. Published originally as…
A growing class of applications depends on fair ordering, where events that occur earlier should be processed before later ones. Providing such guarantees is difficult in practice because clock synchronization is inherently imperfect:…
We study how macroscopic observational constraints restrict admissible microscopic explanatory structures when no intrinsic order or dynamics is assumed a priori. Starting from an unordered collection of measurement outcomes, we formulate…
We present a heuristic algorithm for solving the problem of scheduling plans of tasks. The plans are ordered vectors of tasks, and tasks are basic operations carried out by resources. Plans are tied by temporal, precedence and resource…
This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…
We give an analysis over a variation of causal sets where the light cone of an event is represented by finitely branching trees with respect to any given arbitrary dynamics. We argue through basic topological properties of Cantor space that…