Search NASA⌕ Search

SEARCH · Search NASA

Results for “Theorem Proving”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Machine-checked proofs of the design and implementation of a fault-tolerant circuit

A formally verified implementation of the 'oral messages' algorithm of Pease, Shostak, and Lamport is described. An abstract implementation of the algorithm is verified to achieve interactive consistency in the presence of faults. This abstract characterization is then mapped down to a hardware level implementation which inherits the fault-tolerant characteristics of the abstract version. All steps in the proof were checked with the Boyer-Moore theorem prover. A significant results is the demonstration of a fault-tolerant device that is formally specified and whose implementation is proved correct with respect to this specification. A significant simplifying assumption is that the redundant processors behave synchronously. A mechanically checked proof that the oral messages algorithm is 'optimal' in the sense that no algorithm which achieves agreement via similar message passing can tolerate a larger proportion of faulty processor is also described.

Bevier, William R.↗
NASA NTRS1971

Stability of uncertain systems

The asymptotic properties of feedback systems are discussed, containing uncertain parameters and subjected to stochastic perturbations. The approach is functional analytic in flavor and thereby avoids the use of Markov techniques and auxiliary Lyapunov functionals characteristic of the existing work in this area. The results are given for the probability distributions of the accessible signals in the system and are proved using the Prohorov theory of the convergence of measures. For general nonlinear systems, a result similar to the small loop-gain theorem of deterministic stability theory is given. Boundedness is a property of the induced distributions of the signals and not the usual notion of boundedness in norm. For the special class of feedback systems formed by the cascade of a white noise, a sector nonlinearity and convolution operator conditions are given to insure the total boundedness of the overall feedback system.

Blankenship, G. L.↗
NASA NTRSDate not supplied

Formal Methods in the Development of Highly Assured Software for Unmanned Aircraft Systems

In traditional software development methodologies, operational and functional requirements of systems are often specified in structured natural language notations. These restricted notations provide good documentation support, but only provide limited support for semantic analysis. These notations are generally not rich enough to unambiguously specify the requirements of safety-critical systems that, for example, involve complex numerical computations or that interact with the physical environment. Examples of these safety-critical systems are autonomous vehicles such as unmanned aircraft systems. This talk advocates the use of expressive formal logics, such as higher-order logic, to specify the operational and functional requirement of unmanned systems and to prove the correctness of these requirements. Semantic analysis of requirements written in higher-order logic is supported through the use of interactive theorem provers. Formal models serve as ideal reference implementations of functional requirements. Hence, formal logics enable software validation techniques where software implementations can be checked against functional requirements in a mechanical way. The Formal Methods group in the Safety-Critical Avionics Systems Branch at NASA Langley Research Center has conducted research on the development and application of formal verification techniques to safety-critical applications of interest to NASA for more than 30 years. This talk illustrates the use of formal methods in the development of highly-assured autonomous unmanned aircraft systems.

Formal Methods↗
NASA NTRS2014

A Formally-Verified Decision Procedure for Univariate Polynomial Computation Based on Sturm's Theorem

Sturm's Theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semiopen interval. This paper presents a formalization of this theorem in the PVS theorem prover, as well as a decision procedure that checks whether a polynomial is always positive, nonnegative, nonzero, negative, or nonpositive on any input interval. The soundness and completeness of the decision procedure is proven in PVS. The procedure and its correctness properties enable the implementation of a PVS strategy for automatically proving existential and universal univariate polynomial inequalities. Since the decision procedure is formally verified in PVS, the soundness of the strategy depends solely on the internal logic of PVS rather than on an external oracle. The procedure itself uses a combination of Sturm's Theorem, an interval bisection procedure, and the fact that a polynomial with exactly one root in a bounded interval is always nonnegative on that interval if and only if it is nonnegative at both endpoints.

Narkawicz, Anthony J.↗
NASA NTRS1983

Necessary conditions for optimization in multiparameter discrete systems

A general first-order dynamic representation for discrete systems with several independent variables is proposed, based on the Dieudonne-Rashevsky form for partial differential equations. This representation does not restrict consideration to causal systems. A minimum principle for such systems is proved, thus extending results known for discrete-time systems to the case of several independent variables. The proof requires only the classical implicit function theorem.

Hegg, D. R.↗
NASA NTRS1980

Towards sub-optimal stochastic control of partially observable stochastic systems

The paper deals with a class of multidimensional stochastic control problems with noisy data and bounded controls encountered in aerospace design. The emphasis is on suboptimal design, the optimality being taken in quadratic mean sense. To that effect the problem is viewed as a stochastic version of the Lurie problem known from nonlinear control theory. The main result is a separation theorem (involving a nonlinear Kalman-like filter) suitable for Lurie-type approximations. The theorem allows for discontinuous characteristics. As a byproduct the existence of strong solutions to a class of non-Lipschitzian stochastic differential equations in n dimensions is proved.

Ruzicka, G. J.↗
NASA NTRS1983

Investigation, Development, and Evaluation of Performance Proving for Fault-tolerant Computers

A number of methodologies for verifying systems and computer based tools that assist users in verifying their systems were developed. These tools were applied to verify in part the SIFT ultrareliable aircraft computer. Topics covered included: STP theorem prover; design verification of SIFT; high level language code verification; assembly language level verification; numerical algorithm verification; verification of flight control programs; and verification of hardware logic.

Levitt, K. N.↗
DOE OSTI2024

Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements

In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.

Lei, Jinlong↗
NASA NTRS1972

Application of Contraction Mappings to the Control of Nonlinear Systems

The theoretical and applied aspects of successive approximation techniques are considered for the determination of controls for nonlinear dynamical systems. Particular emphasis is placed upon the methods of contraction mappings and modified contraction mappings. It is shown that application of the Pontryagin principle to the optimal nonlinear regulator problem results in necessary conditions for optimality in the form of a two point boundary value problem (TPBVP). The TPBVP is represented by an operator equation and functional analytic results on the iterative solution of operator equations are applied. The general convergence theorems are translated and applied to those operators arising from the optimal regulation of nonlinear systems. It is shown that simply structured matrices and similarity transformations may be used to facilitate the calculation of the matrix Green functions and the evaluation of the convergence criteria. A controllability theory based on the integral representation of TPBVP's, the implicit function theorem, and contraction mappings is developed for nonlinear dynamical systems. Contraction mappings are theoretically and practically applied to a nonlinear control problem with bounded input control and the Lipschitz norm is used to prove convergence for the nondifferentiable operator. A dynamic model representing community drug usage is developed and the contraction mappings method is used to study the optimal regulation of the nonlinear system.

Killingsworth, W. R., Jr.↗
NASA NTRS1973

The Dirichlet problem for the two-dimensional Helmholtz equation for an open boundary

Development of a complete theory of the two-dimensional Dirichlet problem for an open boundary. It is shown that the solution of the Dirichlet problem for an open boundary requires the solution of a Fredholm integral equation of the first kind. Although a Fredholm integral equation of the first kind usually has no solution if the kernel is continuous, owing to the logarithmic singularity of the kernel, the equation in this case is converted to a singular integral equation with a Cauchy kernel. It is proven that the homogeneous adjoint equation of the singular integral equation has no nonzero solution. By virtue of this result, and with the aid of an existence theorem known in the theory of singular integral equations, the existence of solutions of the singular integral equation, and then of the unique solution of the Fredholm integral equation of the first kind is proved.

Hayashi, Y.↗
NASA NTRS2001

Discontinuous Galerkin Methods for NonLinear Differential Systems

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the PDE (partial differential equation) system. Central to the development of the simplified DG methods is the Eigenvalue Scaling Theorem which characterizes right symmetrizers of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobian matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler equations of gas dynamics and extended conservation law systems derivable as moments of the Boltzmann equation. Using results from kinetic Boltzmann moment closure theory, we then derive and prove energy stability for several approximate DG fluxes which have practical and theoretical merit.

Barth, Timothy↗
NASA NTRS2010

TPSAS-NF1676L-9990-DND

PVS (Prototype Veri cation System)1 is an interactive environment for the specification and verification of systems. PVS provides a strongly typed specification language, which is based on Higher-Order Logic. The type system of PVS supports: sub-typing, dependent-types, abstract data types, parametric types, records, unions, and tuples. The PVS theorem prover includes decision procedures for a variety of theories such as linear arithmetic, propositional logic, and temporal logic. This seminar will provide a gentle introduction to the basic and advanced features of PVS, including: theory interpretations, real number proving, batch proving, rapid prototyping, and strategy development. All these features are illustrated with simple examples and exercises.

César Muñoz↗
NASA NTRS2017

Extrapolating the Trends of Test Drop Data with Opening Shock Factor Calculations: the Case of the Orion Main and Drogue Parachutes Inflating to 1st Reefed Stage

We describe a new calculation of the opening shock factor C (sub k) characterizing the inflation performance of NASA's Orion spacecraft main and drogue parachutes opening under a reefing constraint (1st stage reefing), as currently tested in the Capsule Parachute Assembly System (CPAS) program. This calculation is based on an application of the Momentum-Impulse Theorem at low mass ratio (R (sub m) is less than 10 (sup -1)) and on an earlier analysis of the opening performance of drogues decelerating point masses and inflating along horizontal trajectories. Herein we extend the reach of the Theorem to include the effects of payload drag and gravitational impulse during near-vertical motion - both important pre-requisites for CPAS parachute analysis. The result is a family of C (sub k) versus R (sub m) curves which can be used for extrapolating beyond the drop-tested envelope. The paper proves this claim in the case of the CPAS Mains and Drogues opening while trailing either a Parachute Compartment Drop Test Vehicle or a Parachute Test Vehicle (an Orion capsule boiler plate). It is seen that in all cases the values of the opening shock factor can be extrapolated over a range in mass ratio that is at least twice that of the test drop data.

Potvin, Jean↗
DOE OSTI2026

Quantum speed limit for the out-of-time-ordered correlator from an open-system perspective

Scrambling, the delocalization of initially localized quantum information, is commonly characterized by the out-of-time-ordered correlator (OTOC). Employing the OTOC–Renyi-2 entropy theorem, we derive a quantum speed limit for the OTOC, which sets a lower bound for the rate with which information can be scrambled. This bound becomes particularly tractable by describing the scrambling of information in a closed quantum system as an effective decoherence process of an open system interacting with an environment. We prove that decay of the OTOC can be bounded by the strength of the system-environment coupling and two-point environmental correlation functions. We validate our analytic bound numerically using the nonintegrable transverse field Ising model. Furthermore, our results provide a universal and model-agnostic quantitative framework for understanding the dynamical limits of information spreading across quantum many-body physics, condensed matter systems, and engineered quantum platforms.

Fermions↗
NASA NTRS1979

An algebraic structure of discrete-time biaffine systems

New results on the realization of finite-dimensional, discrete-time, internally biaffine systems are presented in this paper. The external behavior of such systems is described by multiaffine functions and the state space is constructed via Nerode equivalence relations. We prove that the state space is an affine space. An algorithm which amounts to choosing a frame for the affine space is presented. Our algorithm reduces in the linear and bilinear case to a generalization of algorithms existing in the literature. Explicit existence criteria for span-canonical realizations as well as an affine isomorphism theorem are given.

Tarn, T.-J.↗
NASA NTRS1975

Random coding strategies for minimum entropy

This paper proves that there exists a fixed random coding strategy for block coding a memoryless information source to achieve the absolute epsilon entropy of the source. That is, the strategy can be chosen independent of the block length. The principal new tool is an easy result on the semicontinuity of the relative entropy functional of one probability distribution with respect to another. The theorem generalizes a result from rate-distortion theory to the 'zero-infinity' case.

Posner, E. C.↗
DOE OSTI2025

Higher Hall conductivity from a single wave function: Obstructions to symmetry-preserving gapped edge of (2+1)-dimensional topological order

A (2+1)D topologically ordered phase with U(1) symmetry may or may not have a symmetric gapped edge state, even if both thermal and electric Hall conductivity are vanishing. It has recently been discovered that there are “higher” versions of Hall conductivity valid for fermionic fractional quantum Hall (FQH) states that obstruct symmetry-preserving gapped edge states beyond thermal and electric Hall conductivity. In this paper, we show that one can extract higher Hall conductivity from a single wave function of an FQH state, by evaluating the expectation value of the “partial rotation” unitary, which is a combination of partial spatial rotation and a U(1) phase rotation. This result is verified numerically with the fermionic Laughlin state with 𝜈=1/3 and 1/5, as well as the non-Abelian Moore-Read state. Together with topological entanglement entropy, we prove that the expectation values of the partial rotation completely determine if a bosonic/fermionic Abelian topological order with U(1) symmetry has a symmetry-preserving gappable edge state or not. We also show that thermal and electric Hall conductivity of Abelian topological order can be extracted by partial rotations. Even in non-Abelian FQH states, partial rotation provides the Lieb-Schultz-Mattis type theorem constraining the low-energy spectrum of the bulk-boundary system. The generalization of higher Hall conductivity to the case with Lie group symmetry is also presented.

2-dimensional systems↗
NASA NTRS1978

Estimation and filter stability of stochastic delay systems

Linear and nonlinear filtering for stochastic delay systems are studied. A representation theorem for conditional moment functionals is obtained, which, in turn, is used to derive stochastic differential equations describing the optimal linear or nonlinear filter. A complete characterization of the optimal filter is given for linear systems with Gaussian noise. Stability of the optimal filter is studied in the case where there are no delays in the observations. Using the duality between linear filtering and control, asymptotic stability of the optimal filter is proved. Finally, the cascade of the optimal filter and the deterministic optimal quadratic control system is shown to be asymptotically stable as well.

Kwong, R. H.↗