Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “timed 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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Designing Secure and Resilient Cyber-Physical Systems Using Formal Models

This work-in-progress paper proposes a design methodology that addresses the complexity and heterogeneity of cyber-physical systems (CPS) while simultaneously proving resilient control logic and security properties. The design methodology involves a formal methods-based approach by translating the complex control logic and security properties of a water flow CPS into timed automata. Timed automata are a formal model that describes system behaviors and properties using mathematics-based logic languages with precision. Due to the semantics that are used in developing the formal models, verification techniques, such as theorem proving and model checking, are used to mathematically prove the specifications and security properties of the CPS. This work-in-progress paper aims to highlight the need for formalizing plant models by creating a timed automata of the physical portions of the water flow CPS. Extending the time automata with control logic, network security, and privacy control processes is investigated. The final model will be formally verified to prove the design specifications of the water flow CPS to ensure efficacy and security.

42 ENGINEERING↗
DOE OSTI2019

Action principles for quantum automata and Lorentz invariance of discrete time quantum walks

A discrete action principle for general quantum automata is proposed. This action principle is particularized to Discrete Time Quantum Walks (DTQWs) and then extended into an energy and momentum preserving, manifestly covariant formulation. Space–time coordinates are introduced as new variables of the action and their equations of motion enforce energy and momentum conservation. This guarantees that the proposed action can be used to build future, DTQW-based self-consistent models of spinors interacting with gauge fields. A discrete stress–energy tensor for the DTQW is also obtained. The manifest covariance of the formulation highlights the special role played by the grid reference frame in the DTQW dynamics. The main discussion is complemented by three appendices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

A Runtime Verification Framework for Control System Simulation

n a standard workflow for the validation of a control system, the control system is implemented as an extension to a simulator. Such simulators are complex software systems, and engineers may unknowingly violate constraints a simulator places on extensions. As such, errors may be introduced in the implementation of either the control system or the simulator leading to invalid simulation results. This paper presents a novel runtime verification approach for verifying control system implementations within simulators. The major contribution of the approach is the two-tier specification process. In the first tier, engineers model constraints using a domain-specific language tailored to modeling a controller’s response to changes in its input. The language is high-level and effectively hides the implementation details of the simulator, allowing engineers to specify design-level constraints independent of low-level simulator interfaces. In the second tier, simulator developers provide mapping rules for mapping design-level constraints to the implementation of the simulator. Using the rules, an automated tool transforms the design-level specifications into simulator-specific runtime verification specifications and generates monitoring code which is injected into the implementation of the simulator. During simulation, these monitors observe the input and output variables of the control system and report changes to the verifier. The verifier checks whether these changes follow the constraints of the control system. We describe application of this approach to the verification of the constraints of an HVAC control system implemented with the power grid simulator GridLAB-D.

control system↗
DOE OSTI2026

A scalable framework for efficient coupling of thermal and microstructural simulations in additive manufacturing

Predicting microstructure evolution in metal additive manufacturing (AM) is important for process optimization, but spatiotemporal scale disparities between thermal transport and microstructure evolution create significant challenges for efficient data transfer between simulation codes. To address this, we present Stork, a scalable framework for coupling thermal and microstructural simulations. Stork uses a sparse data representation to identify and store active solidification sub-volumes, enabling highly parallel quad-linear interpolation from coarse thermal grids to fine microstructure grids without large intermediate storage. We demonstrate the framework by coupling the semi-analytic heat transfer code 3DThesis with the time-parallel cellular automata code Toucan. This approach achieves over two orders of magnitude reduction in data generation time and file size compared to prior workflows. Numerical studies show that quad-linear interpolation preserves grain morphology and crystallographic texture in laser powder bed fusion (LPBF) simulations for coarsening ratios up to 16. Overall, Stork provides a scalable pathway for high-throughput, component-scale AM simulations on modern high-performance computing systems.

36 MATERIALS SCIENCE↗
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 OSTI2014

Weighted Watson-Crick automata

There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

60 APPLIED LIFE SCIENCES↗
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↗
DOE OSTI2025

Toucan: A performance portable, scalable implementation of the DECA algorithm

In the field of additive manufacturing (AM), cellular automata (CA) is extensively used to simulate microstructural evolution during solidification. However, while traditional CA approaches are relatively fast, they still require a substantial number of time steps, are limited to moderate volumes, and are relatively difficult to improve through parallelism due to the highly localized nature of the solidification front. Here, to address these issues of time to solution and load balancing, we introduce Toucan, a parallel, performance-portable, and scalable code written in C++ with the Kokkos library that leverages the discrete event inspired cellular automata (DECA) algorithm to perform parallel-in-time (PinT) grain growth simulations. Toucan effectively mitigates load balancing issues by distributing the computational workload more evenly across processors, enhancing scalability and efficiency. We conduct both strong and weak scaling studies on up to 64 GPUs on the Frontier supercomputer, demonstrating that Toucan significantly outperforms the current state-of-the-art, time-stepped CA code, ExaCA, on both single and multi-GPU simulations. Even in AM-specific weak scaling scenarios, Toucan maintains near-ideal scaling, in contrast to the linear increase observed with ExaCA due to the moving laser raster pattern. This study highlights Toucan’s potential to transform microstructural simulations in AM by radically improving both efficiency and scalability over existing methods.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Discrete event cellular automata: A new approach to cellular automata for computational material science

Here, we explore the computational advantages of discrete event simulation for cellular automata models of grain growth. These benefits include a reduction in execution time by up to an order of magnitude and the elimination of numerical errors that stem from overshooting grain capture events and approximating a Poisson process with a Bernoulli process. The fundamental mechanisms speeding up the discrete event simulation are uncovered, and with these we create a speedup model that explains our experimental outcomes.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Application of cellular automata approach for cloud simulation and rendering

Current techniques for creating clouds in games and other real time applications produce static, homogenous clouds. These clouds, while viable for real time applications, do not exhibit an organic feel that clouds in nature exhibit. These clouds, when viewed over a time period, were able to deform their initial shape and move in a more organic and dynamic way. With cloud shape technology we should be able in the future to extend to create even more cloud shapes in real time with more forces. Clouds are an essential part of any computer model of a landscape or an animation of an outdoor scene. A realistic animation of clouds is also important for creating scenes for flight simulators, movies, games, and other. Our goal was to create a realistic animation of clouds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2013

Automata-based Debugging for Dissimilar Parallel Tasks

AutomaDeD is a tool that automatically diagnoses performance and correctness faults in MPI applications. It creates time and control-flow models of processes in an MPI program, and when a failure occus, these models are analyzed probabilistically to find the origin of the failure. The output of the tool is MPI processes ranked by the abnormality degree and regions of code where faults are first manifested. The granularity of code region is an MPI call or a computation region between two MPI calls.

Source record↗
DOE OSTI2013

Automata-based Debugging for Dissimilar Parallel Tasks

AutomaDeD is a tool that automatically diagnoses performance and correctness faults in MPI applications. It creates time and control-flow models of processes in an MPI program, and when a failure occus, these models are analyzed probabilistically to find the origin of the failure. The output of the tool is MPI processes ranked by the abnormality degree and regions of code where faults are first manifested. The granularity of code region is an MPI call or a computation region between two MPI calls.

Source record↗
DOE OSTI2022

ExaCA: A performance portable exascale cellular automata application for alloy solidification modeling

Modeling the as-solidified grain structures that form during alloy processing is a critical component in understanding process-property relationships, particularly for additive manufacturing (AM) where grain structure is very sensitive to processing conditions. While cellular automata (CA)-based models have proven able to predict aspects of microstructure for several alloys and AM process conditions, long run times and large resource sets required limit the utility and the problem size to which existing CA models can be applied. As part of the ExaAM project, an initiative within the Exascale Computing Project (ECP) to develop, test, and optimize an exascale-capable coupled and self-consistent model of AM parts, we developed ExaCA (https://github.com/LLNL/ExaCA) for the liquid–solid phase transformation in the wake of AM melt pools. The CA-based code is parallelized using MPI and the Kokkos programming model, the latter enabling simulation on both CPUs and GPUs within a single-source implementation. Here, we detail the steps taken to transform a baseline, MPI-based CA code into one that is performant on CPUs and GPUs. Performance testing of ExaCA on Summit (a pre-exascale machine at Oak Ridge National Laboratory) was used to quantify CPU–GPU speedup comparing with equal numbers of nodes. Testing showed comparable CPU performance to the MPI-only CA code and a 5-20x speedup when running AM-based test problems using GPUs. The improved performance of CA through GPU utilization and the performance portable nature of ExaCA will enable accurate part-scale modeling by harnessing the power of current and future generations of high performance computing resources. Future work will include improving the strong scaling of ExaCA on GPUs by reducing load imbalance associated with the locality of the problem, and continuing performance optimization across exascale hardware.

36 MATERIALS SCIENCE↗
DOE OSTI2023

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP5

These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗
DOE OSTI2023

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP3 and SSP5 [Updated simulations based on population-driven urban intensity transitions]

These data (v3) are updated from previous versions (1 and 2) in that they include consider the effects of population on transitions in urban land intensity. This leads to more reasonable differences in urban land projections under variant SSPs. For the present dataset, both SSP3 and SSP5 are provided. These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) and SSP 3 based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗