Search NASA⌕ Search

SEARCH · Search NASA

Results for “Probabilistic automata”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

7 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Distribution functions of probabilistic automata

Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

Denotational semantics↗
DOE OSTI2023

Absolutely Stable Time Crystals at Finite Temperature

Here, we show that locally interacting, periodically driven (Floquet) Hamiltonian dynamics coupled to a Langevin bath support finite-temperature discrete time crystals (DTCs) with an infinite autocorrelation time. By contrast to both prethermal and many-body localized DTCs, the time crystalline order we uncover is stable to arbitrary perturbations, including those that break the time translation symmetry of the underlying drive. Our approach utilizes a general mapping from probabilistic cellular automata to open classical Floquet systems undergoing continuous-time Langevin dynamics. Applying this mapping to a variant of the Toom cellular automaton, which we dub the "π-Toom time crystal," leads to a 2D Floquet Hamiltonian with a finite-temperature DTC phase transition. We provide numerical evidence for the existence of this transition, and analyze the statistics of the finite temperature fluctuations. Finally, we discuss how general results from the field of probabilistic cellular automata imply the existence of discrete time crystals (with an infinite autocorrelation time) in all dimensions, d ≥ 1.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Classical discrete time crystals

The spontaneous breaking of time-translation symmetry in periodically driven quantum systems leads to a new phase of matter: the discrete time crystal (DTC). This phase exhibits collective subharmonic oscillations that depend upon an interplay of non-equilibrium driving, many-body interactions and the breakdown of ergodicity. However, subharmonic responses are also a well-known feature of classical dynamical systems ranging from predator–prey models to Faraday waves and a.c.-driven charge density waves. This raises the question of whether these classical phenomena display the same rigidity characteristic of a quantum DTC. In this work, we explore this question in the context of periodically driven Hamiltonian dynamics coupled to a finite-temperature bath, which provides both friction and, crucially, noise. Focusing on one-dimensional chains, where in equilibrium any transition would be forbidden at finite temperature, we provide evidence that the combination of noise and interactions drives a sharp, first-order dynamical phase transition between a discrete time-translation invariant phase and an activated classical discrete time crystal (CDTC) in which time-translation symmetry is broken out to exponentially long timescales. Power-law correlations are present along a first-order line, which terminates at a critical point. We analyse the transition by mapping it to the locked-to-sliding transition of a d.c.-driven charge density wave. To conclude, building upon results from the field of probabilistic cellular automata, we conjecture the existence of classical time crystals with true long-range order, where time-translation symmetry is broken out to infinite times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1999

Unifying Model-Based and Reactive Programming within a Model-Based Executive

Real-time, model-based, deduction has recently emerged as a vital component in AI's tool box for developing highly autonomous reactive systems. Yet one of the current hurdles towards developing model-based reactive systems is the number of methods simultaneously employed, and their corresponding melange of programming and modeling languages. This paper offers an important step towards unification. We introduce RMPL, a rich modeling language that combines probabilistic, constraint-based modeling with reactive programming constructs, while offering a simple semantics in terms of hidden state Markov processes. We introduce probabilistic, hierarchical constraint automata (PHCA), which allow Markov processes to be expressed in a compact representation that preserves the modularity of RMPL programs. Finally, a model-based executive, called Reactive Burton is described that exploits this compact encoding to perform efficIent simulation, belief state update and control sequence generation.

Williams, Brian C.↗
NASA NTRS1995

Model checking

Automatic formal verification methods for finite-state systems, also known as model-checking, successfully reduce labor costs since they are mostly automatic. Model checkers explicitly or implicitly enumerate the reachable state space of a system, whose behavior is described implicitly, perhaps by a program or a collection of finite automata. Simple properties, such as mutual exclusion or absence of deadlock, can be checked by inspecting individual states. More complex properties, such as lack of starvation, require search for cycles in the state graph with particular properties. Specifications to be checked may consist of built-in properties, such as deadlock or 'unspecified receptions' of messages, another program or implicit description, to be compared with a simulation, bisimulation, or language inclusion relation, or an assertion in one of several temporal logics. Finite-state verification tools are beginning to have a significant impact in commercial designs. There are many success stories of verification tools finding bugs in protocols or hardware controllers. In some cases, these tools have been incorporated into design methodology. Research in finite-state verification has been advancing rapidly, and is showing no signs of slowing down. Recent results include probabilistic algorithms for verification, exploitation of symmetry and independent events, and the use symbolic representations for Boolean functions and systems of linear inequalities. One of the most exciting areas for further research is the combination of model-checking with theorem-proving methods.

Dill, David L.↗