Related papers: The Bloom Clock
From a thermodynamic point of view, all clocks are driven by irreversible processes. Additionally, one can use oscillatory systems to temporally modulate the thermodynamic flux towards equilibrium. Focusing on the most elementary…
The cosmological applications of atomic clocks so far have been limited to searches of the uniform-in-time drift of fundamental constants. In this paper, we point out that a transient in time change of fundamental constants can be induced…
The passage of time is tracked by counting oscillations of a frequency reference, such as Earth's revolutions or swings of a pendulum. By referencing atomic transitions, frequency (and thus time) can be measured more precisely than any…
Many astrophysical bursts can recur, and their time series structure or pattern could be closely tied to the emission and system physics. While analysis of periodic events is well established, some sources, e.g. some fast radio bursts and…
As a consequence of gravitomagnetism, which is a fundamental weak-field prediction of general relativity and ubiquitous in gravitational phenomena, clocks show a difference in their proper periods when moving along identical orbits in…
All clocks, in some form or another, use the evolution of nature towards higher entropy states to quantify the passage of time. Due to the statistical nature of the second law and corresponding entropy flows, fluctuations fundamentally…
In this paper, we present the Difference- Based Causality Learner (DBCL), an algorithm for learning a class of discrete-time dynamic models that represents all causation across time by means of difference equations driving change in a…
Timed automata are a widely used formalism for specifying the discrete-state/continuous-time behavior of time-critical reactive systems. For the fundamental verification problem of comparing two timed automata, it has been shown that timed…
In this work, we present an extensive analysis of clock synchronization algorithms, with a specific focus on message complexity. We begin by introducing fundamental concepts in clock synchronization, such as the Byzantine generals problem…
We introduce the concept of an entangled clock, where the flow of time is operationally defined by the discrete registration of measurement outcomes on a singlet state. Comparing the synchronization rate of two such clocks against classical…
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show…
There are a number of problematic features within the current treatment of time in physical theories, including the "timelessness" of the Universe as encapsulated by the Wheeler-DeWitt equation. This paper considers one particular…
Quorum sensing is a decentralized biological process, through which a community of cells with no global awareness coordinate their functional behaviors based solely on cell-medium interactions and local decisions. This paper draws…
Intruders can infer properties of a system by measuring the time it takes for the system to respond to some request of a given protocol, that is, by exploiting time side channels. These properties may help intruders distinguish whether a…
This article generalizes the conditional probability interpretation of time in which time evolution is realized through entanglement between a clock and a system of interest. This formalism is based upon conditioning a solution to the…
The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first…
Spreading processes on graphs arise in a host of application domains, from the study of online social networks to viral marketing to epidemiology. Various discrete-time probabilistic models for spreading processes have been proposed. These…
Understanding the run-time behavior of concurrent programs is a challenging task. A popular approach is to establish a happens- before relation via vector clocks. Thus, we can identify bugs and per- formance bottlenecks, for example, by…
Atomic clocks are typically operated by locking a local oscillator (LO) to a single atomic ensemble. In this article we propose a scheme where the LO is locked to several atomic ensembles instead of one. This results in an exponential…
Deadlocks are a major source of bugs in concurrent programs. They are hard to predict, because they may only occur under specific scheduling conditions. Dynamic analysis attempts to identify potential deadlocks by examining a single…