Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “formal”

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 OSTI2023

Parameterization of Direct and Doorway Processes in R-Matrix Formalism

R-matrix formalism is extended beyond compound nuclear (CN) resonant reactions to include parameterization of direct as well as doorway processes. Direct processes in the R-matrix exterior are parameterized by a unitary matrix that introduces mixing among wave function coefficients of the incoming and outgoing wave function components at the R-matrix channel surface. Doorway processes are parameterized by separating the Hilbert space of the interior R-matrix region into its doorway and CN subspaces, from which doorway state eigenenergies, reduced width amplitudes, and the strengths of their coupling to CN levels appear as new R-matrix parameters. Parameterization of generalized as well as the conventional Reich–Moore approximation for eliminated capture channels in the presence of direct, doorway, and CN processes is presented along with a complex-valued scattering length with contributions from direct, doorway, and CN capture processes. Derivation of Brune’s alternative R-matrix parameters is extended to include doorway states. This work suggests how R-matrix formalism could be extended further by adopting the concepts from related reaction formalisms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

How to describe collective decay of uncoupled modes in the input–output formalism

We extend the input–output formalism to study the behavior of uncoupled discrete modes (bosonic cavity modes and fermionic qubits) when they decay to the same Markovian continuum. When the continuum interacts with only a single mode, this decay is irreversible. However, when multiple modes decay to the same Markovian continuum they develop correlations and decay collectively. In the input–output formalism these correlations manifest in additional terms in the quantum Langevin equation. For two modes, this collective decay can dramatically extend the lifetimes of both modes (Dicke subradiance) and, within the single-mode subsystem, induces non-Markovian memory effects including energy backflow.

Propp, Tzula B. (ORCID:0000000277481434)↗
DOE OSTI2020

A First–Principles–Based Sub–Lattice Formalism for Predicting Off–Stoichiometry in Materials for Solar Thermochemical Applications: The Example of Ceria

Theoretical models that reliably can predict off-stoichiometry in materials via accurate descriptions of underlying thermodynamics are crucial for energy applications. For example, transition-metal and rare-earth oxides that can tolerate a large number of oxygen vacancies, such as CeO 2 and doped CeO 2 , can split water and carbon dioxide via a two-step, oxide-based solar thermochemical (STC) cycle. The search for new STC materials with a performance superior to that of state-of-the-art CeO 2 can benefit from predictions accurately describing the thermodynamics of oxygen vacancies. The sub-lattice formalism, a common tool used to fit experimental data and build temperature-composition phase diagrams, can be useful in this context. Here, sub-lattice models are derived solely from zero-temperature quantum mechanics calculations to estimate fairly accurate temperature- and oxygen-partial-pressure-dependent off-stoichiometries in CeO 2 and Zr-doped CeO 2 . Physical motivations for deriving some of the “excess” sub-lattice model parameters directly from quantum mechanical calculations, instead of fitting to minimize deviations from experimental and/or theoretical data, are identified. As a result, important limitations and approximations of the approach used are specified and extensions to multi-cation oxides are also suggested to help identify novel candidates for water and carbon dioxide splitting and related applications.

08 HYDROGEN↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Fortran mimetic abstraction language (Formal) v0.1.

The Fortran mimetic abstraction language ("Formal") is a domain-specific language (DSL) embedded in Fortran 202Y [1]. Formal provides novel software abstractions for simulating phenomena governed by the partial differential equations (PDEs) of vector and tensor calculus. Such equations model an extremely broad set of physical phenomena, ranging from atmospheric winds to light propagation. Formal's data structures and algorithms mimic in form and behavior continuous functions and operators. Formal supports these mathematical constructs using mimetic discretizations that define a discrete calculus satisfying various tensor calculus theorems, thereby ensuring high-fidelity representations of the physics being modeled. [2] Formal 0.1.0 also lays a foundation for the future use of Fortran 202Y type-safe templates to facilitate the formal verification of tensor contractions in computational physics and artificial intelligence [3]. [1] "Fortran 202Y" is Fortran standard committee's informal designation for the next Fortran revision, which will likely be "Fortran 2028". [2] Corbino, J. and Castillo, J. (2020) Journal of Computational and Applied Mathematics, https://doi.org/10.1016/j.cam.2019.06.042. [3] Haveraaen, M., Järvi, J., & Rouson, D. (2019). Reflecting on Generics for Fortran. https://j3-fortran.org/doc/year/19/19-188.pdf.

Rouson, Damian [Lawrence Berkeley National Laborat↗
DOE OSTI2024

The First Tri-Lab Workshop on Formal Verification: Capabilities, Challenges, Research Opportunities, and Exemplars

The First Tri-Lab Workshop on Formal Verification was held in Santa Fe, New Mexico, on December 5th, 2023. This workshop gathered staff from Sandia, Los Alamos, and Lawrence Livermore National Laboratories and NASA’s Jet Propulsion Laboratory. This report summarizes and expands on the presentations given and discussion had at this workshop. In this report, we describe the current capabilities and research needs related to formal methods at the NNSA labs. In particular, we identify medium-term and long-term research gaps in programming languages, formalization efforts of complex systems, embedded systems verification, hardware verification, cybersecurity, formal methods usability, workflows, numerical methods, the use of formal methods for artificial intelligence (and its converse, artificial intelligence for formal methods), and collaboration opportunities and considerations on these topics. We conclude with a small number of exemplar research problems related to these topics.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2024

Formally Verified ZTA Requirements for OT/ICS Environments with Isabelle/HOL

The clean energy transformation includes the integration of distributed energy resources with the power grid, which has led to a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Power grids infrastructure represents an operational technology environment that has become a system of systems, integrating heterogeneous devices which are both software-and hardware-intensive; as a result, there are increasing demands to exploit advances in the commodity of software-hardware infrastructures to improve energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, which leads to vulnerabilities and undesirable outcomes. The use of formal methods to characterize and prove system requirements removes ambiguity, increases automation, and provides high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system-level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.

formal methods↗
DOE OSTI2021

Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework

A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Formally Verified ZTA Requirements for OT/ICS Environments with Isabelle/HOL: Preprint

The clean energy transformation led to the integration of distributed energy resources on a top of the grid, and so a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Operational technology environments are becoming a system of systems, integrating heterogeneous devices which are software/hardware intensive, have ever increasing demands to exploit advances in commodity of software/hardware infrastructures, and this for good reasons - improving energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, thus undesirable outcomes will surely happen. The use of formal methods will remove ambiguity, increase automation and provide high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.

formal methods↗
DOE OSTI2024

Investigating Formal Methods Tools and their Applicability for Hardware Vulnerability Remediation

Formal methods use mathematical logic and equations to prove that a system or code is secure. In this poster, I examine existing formal methods tools and their application for projects working to remediate vulnerabilities in hardware and hardware description language. This poster is focused on the tools ReWire and AutoGenILA and I hope to evaluate their benefits and weaknesses with the intention of creating an internal report on the application and weaknesses of existing formal methods tools and identifying gaps for future formal methods tool creation.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Verification of a fully implicit particle-in-cell method for the <!--${MathJax: TeX-AMS-MML_HTMLorMML}--> v &#x2225; -formalism of electromagnetic gyrokinetics in the XGC code

A fully implicit particle-in-cell method for handling the v ∥ -formalism of electromagnetic gyrokinetics has been implemented in XGC. By choosing the v ∥ -formalism, here we avoid introducing the nonphysical skin terms in Ampère's law, which are responsible for the well-known “cancellation problem” in the p ∥ -formalism. The v ∥ -formalism, however, is known to suffer from a numerical instability when explicit time integration schemes are used due to the appearance of a time derivative in the particle equations of motion from the inductive component of the electric field. Here, using the conventional δf scheme, we demonstrate that our implicitly discretized algorithm can provide numerically stable simulation results with accurate dispersive properties. We verify the algorithm using a test case for shear Alfvén wave propagation in addition to a case demonstrating the ion temperature gradient-kinetic ballooning mode (ITG-KBM) transition. The ITG-KBM transition case is compared to results obtained from other δf gyrokinetic codes/schemes, whose verification has already been archived in the literature.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

A formally certified end-to-end implementation of Shor’s factorization algorithm

Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct. While hardware-level decoherence errors have garnered significant attention, a less recognized obstacle to correctness is that of human programming errors—“bugs.” Techniques familiar to most programmers from the classical domain for avoiding, discovering, and diagnosing bugs do not easily transfer, at scale, to the quantum domain because of its unique characteristics. To address this problem, we have been working to adapt formal methods to quantum programming. With such methods, a programmer writes a mathematical specification alongside the program and semiautomatically proves the program correct with respect to it. The proof’s validity is automatically confirmed—certified—by a “proof assistant.” Formal methods have successfully yielded high-assurance classical software artifacts, and the underlying technology has produced certified proofs of major mathematical theorems. As a demonstration of the feasibility of applying formal methods to quantum programming, we present a formally certified end-to-end implementation of Shor’s prime factorization algorithm, developed as part of a framework for applying the certified approach to general applications. By leveraging our framework, one can significantly reduce the effects of human errors and obtain a high-assurance implementation of large-scale quantum applications in a principled way.

Science & Technology - Other Topics↗
DOE OSTI2021

From noise to information: The transfer function formalism for uncertainty quantification in reconstructing the nuclear density

The neutron distribution of neutron-rich nuclei provides critical information on the structure of finite nuclei and neutron stars. Parity violating experiments—such as PREX and CREX—provide a clean and largely model-independent determination of neutron densities. Such experiments, however, are challenging and expensive, which is why sound statistical arguments are required to maximize the information gained. We introduce a new framework, the “transfer function formalism,” aimed at uncertainty quantification, model selection, and experimental design in the context of neutron densities. The transfer functions (TFs) are built analytically by expressing the linear response of the objective function (e.g., χ2) to small perturbations of the data. Using the TF formalism, we are able to analyze the expected overall uncertainty—quantified in terms of bias and variance—of the mean square radius and interior density of 48 Ca and 208 Pb. Using relativistic mean field models as a proxy for the weak-charge density—and assuming that a total of five measurements could be performed on the weak form factor of 48 Ca and 208 Pb—we identify the optimal models and experimental locations that minimize the uncertainty in the extraction of the radius and interior density. We also explore the use of the TF formalism to understand the influence of prior distributions for the model parameters, as well as the optimization of model hyperparameters not constrained by the data. Here,we establish how the choice of experimental locations and the model that is used can have a significant impact on the final uncertainties of the extracted quantities of interest. For challenging experiments such as CREX and PREX, a proper quantification of such uncertainties is critical. We have demonstrated how the TF formalism provides several advantages for this type of analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Three-particle formalism for multiple channels: the ηππ + $ K\overline{K}\pi $ system in isosymmetric QCD

We generalize previous three-particle finite-volume formalisms to allow for multiple three-particle channels. For definiteness, we focus on the two-channel ηππ and $ K\overline{K}\pi $ system in isosymmetric QCD, considering the positive G parity sector of the latter channel, and neglecting the coupling to modes with four or more particles. The formalism we obtain is thus appropriate to study the b 1 (1235) and η(1295) resonances. The derivation is made in the generic relativistic field theory approach using the time-ordered perturbation theory method. We study how the resulting quantization condition reduces to that for a single three-particle channel when one drops below the upper ($ K\overline{K}\pi $) threshold. We also present parametrizations of the three-particle K matrices that enter into the formalism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Formal verification and validation of run-to-completion style state charts using Event-B

State chart notations with ‘run to completion’ semantics are popular with engineers for designing controllers that react to environment events with a sequence of state transitions but lack formal refinement and rigorous verification methods. State chart models are typically used to design complex control systems that respond to environmental triggers with a sequential process. The model is usually constructed at a concrete level and verified and validated using animation techniques relying on human judgement. Event-B, on the other hand, is based on refinement from an initial abstraction and is designed to make formal verification by automatic theorem provers feasible. Abstraction and formal verification provide greater assurance that critical (e.g. safety or security) properties are not violated by the control system. In this paper, we introduce a notion of refinement into a ‘run to completion’ state chart modelling notation and leverage Event-B’s tool support for theorem proving. We describe the difficulties in translating ‘run to completion’ semantics into Event-B refinements and suggest a solution. We illustrate our approach and show how models can be validated at different refinement levels using our scenario checker animation tools. We show how critical invariant properties can be verified by proof despite the reactive nature of the system and how behavioural aspects of the system can be verified by testing the expected reactions using a temporal logic, model checking approach. To verify liveness, we outline a proof that the run to completion is deadlock-free and converges to complete the run.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Derivation of K-matrix reaction theory in a discrete basis formalism

The usual derivations of the S and K matrices for two-particle reactions proceed through the Lippmann–Schwinger equation with formal definitions of the incoming and outgoing scattering states. Here we present a simpler alternative derivation that is carried out completely in the Hamiltonian representation, using a discrete basis of configurations for the scattering channels as well as the quasi-bound configurations of the combined fragments. We use matrix algebra to derive an explicit expression for the K matrix in terms of the Hamiltonian of the internal states of the compound system and the coupling between the channels and the internal states. The formula for the K matrix includes explicitly a real dispersive shift matrix to the internal Hamiltonian that is easily computed in the formalism. That expression is applied to derive the usual form of the S matrix as a sum over poles in the complex energy plane. Some extensions and limitations of the discrete-basis Hamiltonian formalism are discussed in the concluding remarks and in the Appendix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗