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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Granular Contact Forces: Proof of "Self-Ergodicity" by Generalizing Boltzmann's Stosszahlansatz and H Theorem

Ergodicity is proved for granular contact forces. To obtain this proof from first principles, this paper generalizes Boltzmann's stosszahlansatz (molecular chaos) so that it maintains the necessary correlations and symmetries of granular packing ensembles. Then it formally counts granular contact force states and thereby defines the proper analog of Boltzmann's H functional. This functional is used to prove that (essentially) all static granular packings must exist at maximum entropy with respect to their contact forces. Therefore, the propagation of granular contact forces through a packing is a truly ergodic process in the Boltzmannian sense, or better, it is self-ergodic. Self-ergodicity refers to the non-dynamic, internal relationships that exist between the layer-by-layer and column-by-column subspaces contained within the phase space locus of any particular granular packing microstate. The generalized H Theorem also produces a recursion equation that may be solved numerically to obtain the density of single particle states and hence the distribution of granular contact forces corresponding to the condition of self-ergodicity. The predictions of the theory are overwhelmingly validated by comparison to empirical data from discrete element modeling.

Metzger, Philip T.↗
NASA NTRS1991

Arbitrary nonlinearity is sufficient to represent all functions by neural networks - A theorem

It is proved that if we have neurons implementing arbitrary linear functions and a neuron implementing one (arbitrary but smooth) nonlinear function g(x), then for every continuous function f(x sub 1,..., x sub m) of arbitrarily many variables, and for arbitrary e above 0, we can construct a network that consists of g-neurons and linear neurons, and computes f with precision e.

Kreinovich, Vladik YA.↗
NASA NTRS1991

Verification of the FtCayuga fault-tolerant microprocessor system. Volume 2: Formal specification and correctness theorems

Presented here is a formal specification and verification of a property of a quadruplicately redundant fault tolerant microprocessor system design. A complete listing of the formal specification of the system and the correctness theorems that are proved are given. The system performs the task of obtaining interactive consistency among the processors using a special instruction on the processors. The design is based on an algorithm proposed by Pease, Shostak, and Lamport. The property verified insures that an execution of the special instruction by the processors correctly accomplishes interactive consistency, providing certain preconditions hold, using a computer aided design verification tool, Spectool, and the theorem prover, Clio. A major contribution of the work is the demonstration of a significant fault tolerant hardware design that is mechanically verified by a theorem prover.

Bickford, Mark↗
NASA NTRS2000

A Geometrical Approach to Bell's Theorem

Bell's theorem can be proved through simple geometrical reasoning, without the need for the Psi function, probability distributions, or calculus. The proof is based on N. David Mermin's explication of the Einstein-Podolsky-Rosen-Bohm experiment, which involves Stern-Gerlach detectors which flash red or green lights when detecting spin-up or spin-down. The statistics of local hidden variable theories for this experiment can be arranged in colored strips from which simple inequalities can be deduced. These inequalities lead to a demonstration of Bell's theorem. Moreover, all local hidden variable theories can be graphed in such a way as to enclose their statistics in a pyramid, with the quantum-mechanical result lying a finite distance beneath the base of the pyramid.

Rubincam, David Parry↗
NASA NTRS1977

Applications of Algebraic Geometry to Systems Theory

Basic theorems of algebraic geometry are applied to prove some pole-placement theorems, including an improved version of pole placement with output feedback. Examples are given which show the limitations of the algebro-geometric theorems and their potential value for systems theory. This paper and those to follow might contribute towards making the powerful theorems of modern algebraic geometry accessible and applicable to problems of engineering.

Hermann, Robert↗
NASA NTRS1978

Forced oscillations in quadratically damped systems

Bayliss (1975) has studied the question whether in the case of linear differential equations the relationship between the stability of the homogeneous equations and the existence of almost periodic solutions to the inhomogeneous equation is preserved by finite difference approximations. In the current investigation analogous properties are considered for the case in which the damping is quadratic rather than linear. The properties of the considered equation for arbitrary forcing terms are examined and the validity is proved of a theorem concerning the characteristics of the unique solution. By using the Lipschitz continuity of the mapping and the contracting mapping principle, almost periodic solutions can be found for perturbations of the considered equation. Attention is also given to the Lipschitz continuity of the solution operator and the results of numerical tests which have been conducted to test the discussed theory.

Bayliss, A.↗
NASA NTRS1984

On some properties of force-free magnetic fields in infinite regions of space

Techniques for solving boundary value problems (BVP) for a force free magnetic field (FFF) in infinite space are presented. A priori inequalities are defined which must be satisfied by the force-free equations. It is shown that upper bounds may be calculated for the magnetic energy of the region provided the value of the magnetic normal component at the boundary of the region can be shown to decay sufficiently fast at infinity. The results are employed to prove a nonexistence theorem for the BVP for the FFF in the spatial region. The implications of the theory for modeling the origins of solar flares are discussed.

Aly, J. J.↗
NASA NTRS1985

Hopf bifurcation in the presence of symmetry

Group theory is applied to obtain generalized differential equations from the Hopf bifurcation theory on branching to periodic solutions. The conditions under which the symmetry group will admit imaginary eigenvalues are delimited. The action of the symmetry group on the circle group are explored and the Liapunov-Schmidt reduction is used to prove the Hopf theorem in the symmetric case. The emphasis is on simplifying calculations of the stability of bifurcating branches. The resulting general theory is demonstrated in terms of O(2) acting on a plane, O(n) in n-space, and O(3) and an irreducible model for spherical harmonics.

Golubitsky, M.↗
NASA NTRS1994

Exploiting structure: Introduction and motivation

This annual report summarizes the research activities that were performed from 26 Jun. 1993 to 28 Feb. 1994. We continued to investigate the Robust Stability of Systems where transfer functions or characteristic polynomials are affine multilinear functions of parameters. An approach that differs from 'Stability by Linear Process' and that reduces the computational burden of checking the robust stability of the system with multilinear uncertainty was found for low order, 2-order, and 3-order cases. We proved a crucial theorem, the so-called Face Theorem. Previously, we have proven Kharitonov's Vertex Theorem and the Edge Theorem by Bartlett. The detail of this proof is contained in the Appendix. This Theorem provides a tool to describe the boundary of the image of the affine multilinear function. For SPR design, we have developed some new results. The third objective for this period is to design a controller for IHM by the H-infinity optimization technique. The details are presented in the Appendix.

Xu, Zhong Ling↗
NASA NTRS1994

Progress in navigation filter estimate fusion and its application to spacecraft rendezvous

A new derivation of an algorithm which fuses the outputs of two Kalman filters is presented within the context of previous research in this field. Unlike other works, this derivation clearly shows the combination of estimates to be optimal, minimizing the trace of the fused covariance matrix. The algorithm assumes that the filters use identical models, and are stable and operating optimally with respect to their own local measurements. Evidence is presented which indicates that the error ellipsoid derived from the covariance of the optimally fused estimate is contained within the intersections of the error ellipsoids of the two filters being fused. Modifications which reduce the algorithm's data transmission requirements are also presented, including a scalar gain approximation, a cross-covariance update formula which employs only the two contributing filters' autocovariances, and a form of the algorithm which can be used to reinitialize the two Kalman filters. A sufficient condition for using the optimally fused estimates to periodically reinitialize the Kalman filters in this fashion is presented and proved as a theorem. When these results are applied to an optimal spacecraft rendezvous problem, simulated performance results indicate that the use of optimally fused data leads to significantly improved robustness to initial target vehicle state errors. The following applications of estimate fusion methods to spacecraft rendezvous are also described: state vector differencing, and redundancy management.

Carpenter, J. Russell↗
NASA NTRS1995

The AAMP5/AAMP-FV project

This presentation describes a project, formal verification of the microcode in the AAMP5 microprocessor, conducted to explore how formal techniques for specification and verification could be introduced into an industrial process. Sponsored by the Systems Validation Branch of NASA Langley and by Collins Commercial Avionics, a division of Rockwell International, it was conducted by Collins and the SRI International Computer Science Laboratory. The project consisted of specifying in the PVS language developed by SRI a portion of a Rockwell proprietary microprocessor, the AAMP5, at both the instruction set and register-transfer levels and using the PVS theorem prover to prove the microcode correct for a representative subset of instructions. While this presentation includes a brief technical overview, its emphasis is on the lessons learned in using PVS for an example of this size and the implications for using formal methods in an industrial setting. The central result of this project was to demonstrate the feasibility of formally specifying a commercial microprocessor and the use of mechanical proofs of correctness to verify microcode. This is particularly significant since the AAMP5 was not designed for formal verification, but to provide a more than three fold performance improvement, by pipelining instruction execution, while remaining object code compatible with the earlier AAMP2. As a consequence, the AAMP5 is one of the most complex microprocessors to which formal methods have been applied. Another key result was the discovery of both actual and seeded errors. Two actual microcode errors were discovered and corrected during development of the formal specification, illustrating the value of simply creating a precise specification. Two seeded errors were systematically uncovered while doing correctness proofs. One of these was an actual error that had been discovered after first fabrication but left in the microcode provided to SRI. The other error was designed to be unlikely to be detected by walkthroughs, testing, or simulation. Several other results emerged during the project, including the ease with which practicing engineers became comfortable with PVS, the need for libraries of general purpose theories, the usefulness of formal specification in revealing errors, the natural fit between formal specification and inspections, the difficulty of selecting the best style of specification for a new problem domain, the high level of assurance provided by proofs of correctness, and the need to engineer proof strategies for reuse.

Miller, Steven P.↗
NASA NTRS2003

A Survey of Logic Formalisms to Support Mishap Analysis

Mishap investigations provide important information about adverse events and near miss incidents. They are intended to help avoid any recurrence of previous failures. Over time, they can also yield statistical information about incident frequencies that helps to detect patterns of failure and can validate risk assessments. However, the increasing complexity of many safety critical systems is posing new challenges for mishap analysis. Similarly, the recognition that many failures have complex, systemic causes has helped to widen the scope of many mishap investigations. These two factors have combined to pose new challenges for the analysis of adverse events. A new generation of formal and semi-formal techniques have been proposed to help investigators address these problems. We introduce the term mishap logics to collectively describe these notations that might be applied to support the analysis of mishaps. The proponents of these notations have argued that they can be used to formally prove that certain events created the necessary and sufficient causes for a mishap to occur. These proofs can be used to reduce the bias that is often perceived to effect the interpretation of adverse events. Others have argued that one cannot use logic formalisms to prove causes in the same way that one might prove propositions or theorems. Such mechanisms cannot accurately capture the wealth of inductive, deductive and statistical forms of inference that investigators must use in their analysis of adverse events. This paper provides an overview of these mishap logics. It also identifies several additional classes of logic that might also be used to support mishap analysis.

Johnson, Chris↗
NASA NTRS1989

A torus bifurcation theorem with symmetry

Hopf bifurcation in the presence of symmetry, in situations where the normal form equations decouple into phase/amplitude equations is described. A theorem showing that in general such degeneracies are expected to lead to secondary torus bifurcations is proved. By applying this theorem to the case of degenerate Hopf bifurcation with triangular symmetry it is proved that in codimension two there exist regions of parameter space where two branches of asymptotically stable two-tori coexist but where no stable periodic solutions are present. Although a theory was not derived for degenerate Hopf bifurcations in the presence of symmetry, examples are presented that would have to be accounted for by any such general theory.

Vangils, S. A.↗
NASA NTRS1989

Absolute Stability And Hyperstability In Hilbert Space

Theorems on stabilities of feedback control systems proved. Paper presents recent developments regarding theorems of absolute stability and hyperstability of feedforward-and-feedback control system. Theorems applied in analysis of nonlinear, adaptive, and robust control. Extended to provide sufficient conditions for stability in system including nonlinear feedback subsystem and linear time-invariant (LTI) feedforward subsystem, state space of which is Hilbert space, and input and output spaces having finite numbers of dimensions. (In case of absolute stability, feedback subsystem memoryless and possibly time varying. For hyperstability, feedback system dynamical system.)

Wen, John Ting-Yung↗
NASA NTRS1989

Extension of Euler's theorem to n-dimensional spaces

Euler's theorem states that any sequence of finite rotations of a rigid body can be described as a single rotation of the body about a fixed axis in three-dimensional Euclidean space. The usual statement of the theorem in the literature cannot be extended to Euclidean spaces of other dimensions. Equivalent formulations of the theorem are given and proved in a way which does not limit them to the three-dimensional Euclidean space. Thus, the equivalent theorems hold in other dimensions. The proof of one formulation presents an algorithm which shows how to compute an angular-difference matrix that represents a single rotation which is equivalent to the sequence of rotations that have generated the final n-D orientation. This algorithm results also in a constant angular velocity which, when applied to the initial orientation, eventually yields the final orientation regardless of what angular velocity generated the latter. The extension of the theorem is demonstrated in a four-dimensional numerical example.

Bar-Itzhack, Itzhack Y.↗
NASA NTRS1992

A Benes-like theorem for the shuffle-exchange graph

One of the first theorems on permutation routing, proved by V. E. Beness (1965), shows that given a set of source-destination pairs in an N-node butterfly network with at most a constant number of sources or destinations in each column of the butterfly, there exists a set of paths of lengths O(log N) connecting each pair such that the total congestion is constant. An analogous theorem yielding constant-congestion paths for off-line routing in the shuffle-exchange graph is proved here. The necklaces of the shuffle-exchange graph play the same structural role as the columns of the butterfly in Beness' theorem.

Schwabe, Eric J.↗
NASA NTRS1970

On a theorem of K T Chen

Proving normal form of mappings of real line into itself by contracting mapping principle

Braun, M.↗