SEARCH · Search NASA
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.
A theorem (the so-called main theorem) for the validity of the inclusion L sup p(mu) in L sup q(nu) is given, and proved by an application of the closed graph theorem. The main theorem is then applied to some interesting special cases, and concrete results are obtained including different versions of the results of Subramanian (1978) and Romero (1983).
This paper deals with observed processes in situations in which observations are available only when the state vector lies in certain regions. For linear autonomous observed processes, necessary and sufficient conditions are obtained for half-space observation regions. These results are shown to contain a theorem dual to a controllability result proved by the author for a linear autonomous control system whose control restraint set does not contain the origin as an interior point. Observability results relating to continuous observation systems and sampled data systems are presented, and an example of observing the state of an electrical network is given.
New shock-capturing finite difference approximations for solving two scalar conservation law nonlinear partial differential equations describing inviscid, isentropic, compressible flows of aerodynamics at transonic speeds are presented. A global linear stability theorem is applied to these schemes in order to derive a necessary and sufficient condition for the finite element method. A technique is proposed to render the described approximations total variation-stable by applying the flux limiters to the nonlinear terms of the difference equation dimension by dimension. An entropy theorem applying to the approximations is proved, and an implicit, forward Euler-type time discretization of the approximation is presented. Results of some numerical experiments using the approximations are reported.
A class of abstract integrodifferential equations used to model linear viscoelastic beams is investigated analytically, applying a Hilbert-space approach. The basic equation is rewritten as a Cauchy problem, and its well-posedness is demonstrated. Finite-dimensional subspaces of the state space and an estimate of the state operator are obtained; approximation schemes for the equations are constructed; and the convergence is proved using the Trotter-Kato theorem of linear semigroup theory. The actual convergence behavior of different approximations is demonstrated in numerical computations, and the results are presented in tables.
For a spinning flexible spacecraft the mass center generally shifts relative to the nominal undeformed position. It is thought that this shift of center complicates spacecraft stability analysis. It is proved, on the basis of results achieved by Meirovitch and Calico (1972), that for the general class of force-free single-spin flexible spacecraft it is possible to ignore this shift of center without affecting the stability criteria in any significant way. A new theorem on inequalities for quadratic forms is proved to demonstrate the validity of the stability analysis.
The following strategy is suggested for specification and proof: (1) Defer the construction of a formal program specification with respect to I/O assertions unit the correctness of the program with respect to an abstract mathematical model of program intent is demonstrated. (2) Prove that an abstract machine (using infinite precision arithmetic) would compute that object exactly. (3) Prove that the computational sequences of arithmetic operations that occur in the abstract machine must be precisely the same at every step as those occurring on an actual machine (with finite precision arithmetic), executing the same program. (4) Use a Verification Conditions VC-generator that knows about the semantics of arithmetic operations to annotate the program with assertions that bound (or in some circumstances estimate) the difference between the actual machine state variables and the corresponding ones of the abstract machine. Construct the formal program specification by combining the verification conditions into theorems about computational error that can be proved with mechanical assistance.
A characterization of the Laplace transform is developed which extends the transform to the Schwartz distributions. The class of distributions includes the impulse functions and other singular functions which occur as solutions to ordinary and partial differential equations. The standard theorems on analyticity, uniqueness, and invertibility of the transform are proved by using the characterization as the definition of the Laplace transform. The definition uses sequences of linear transformations on the space of distributions which extends the Laplace transform to another class of generalized functions, the Mikusinski operators. It is shown that the sequential definition of the transform is equivalent to Schwartz' extension of the ordinary Laplace transform to distributions but, in contrast to Schwartz' definition, does not use the distributional Fourier transform. Several theorems concerning the particular linear transformations used to define the Laplace transforms are proved. All the results proved in one dimension are extended to the n-dimensional case, but proofs are presented only for those situations that require methods different from their one-dimensional analogs.
Rate distortion function for class of sources, proving positive and negative sides of Shannon encoding theorem for noisy channels
Liapunov functions to determine the stability of non-linear autonomous difference equations can be developed through the use of auxiliary exact difference equations. For this purpose definitions are introduced for the gradient of an implicit function of a discrete variable, a principal sum, a definite sum and an exact difference equation, and a theorem for exactness of a difference form is proved. Examples illustrate the procedure.
The specification and verification work is described in detail, and some of the problems and issues to be resolved in their application to Very Large Scale Integration VLSI systems are examined. The hierarchical design methodologies enable a system architect or design team to decompose a complex design into a formal hierarchy of levels of abstraction. The first step inprogram verification is tree formation. The next step after tree formation is the generation from the trees of the verification conditions themselves. The approach taken here is similar in spirit to the corresponding step in program verification but requires modeling of the semantics of circuit elements rather than program statements. The last step is that of proving the verification conditions using a mechanical theorem-prover.
The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance as the sophistication of our tools and techniques increases. Improvements in tools and techniques come about as we pit the current state of the art against new and challenging problems. A promising area for the application of formal methods is in real-time and distributed computing. Some of the algorithms in this area are both subtle and important. In response to this challenge and as part of an ongoing attempt to verify an implementation of the Interactive Convergence Clock Synchronization Algorithm (ICCSA), we decided to undertake a proof of the correctness of the algorithm using the Boyer-Moore theorem prover. This paper describes our approach to proving the ICCSA using the Boyer-Moore prover.
The PVS Theorem prover is a widely used formal verification tool used for the analysis of safety-critical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all over the world. This paper reports on the formalization of the integral calculus in the PVS theorem prover. All of the basic definitions and theorems covered in a first course on integral calculus have been completed.The theory and proofs were based on Rosenlicht's classic text on real analysis and follow the traditional epsilon-delta method. The goal of this work was to provide a practical set of PVS theories that could be used for verification of hybrid systems that arise in air traffic management systems and other aerospace applications. All of the basic linearity, integrability, boundedness, and continuity properties of the integral calculus were proved. The work culminated in the proof of the Fundamental Theorem Of Calculus. There is a brief discussion about why mechanically checked proofs are so much longer than standard mathematics textbook proofs.
Many problems in analysis are concerned with the dependence upon parameters of fixed points of maps. For contraction mappings, criteria are relatively easy to obtain and have been known for some time. In the study of solutions of functional differential equations, more general results were needed. It is the purpose of this paper to give a rather general fixed-point theorem for condensing maps depending on a parameter, to prove continuous dependence and to indicate how many of the previous results are special cases.
A new characterization of the Laplace transform for Schwartz distributions is developed, using sequences of linear transformations on the space of distributions. The standard theorems on analyticity, uniqueness and invertibility of the transform are proved, using the new characterization as the definition of the Laplace transform. It is shown that this sequential definition is equivalent to Schwartz's extension of the ordinary Laplace transform to distributions which he obtained from the Fourier transform.
We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL. theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications. Such tests correspond to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property. We then suggest an optimized algorithm based on transforming LTL formulae. The work is done using the Maude rewriting system. which turns out to provide a perfect notation and an efficient rewriting engine for performing these experiments.
We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces, The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive in most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications, corresponding to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property end then suggest an optimized algorithm based on transforming LTL formulae. We use the Maude rewriting logic, which turns out to be a good notation and being supported by an efficient rewriting engine for performing these experiments. The work constitutes part of the Java PathExplorer (JPAX) project, the purpose of which is to develop a flexible tool for monitoring Java program executions.
A theorem on the O(3) nonlinear sigma model with the topological theta term is proved, which states that the ground-state energy at theta = pi is always higher than the ground-state energy at theta = 0, for the same value of the coupling constant g. Provided that the nonlinear sigma model gives the correct description for the Heisenberg spin chains in the large-s limit, this theorem makes a definite prediction relating the ground-state energies of the half-integer and the integer spin chains. The ground-state energies obtained from the exact Bethe ansatz solution for the spin-1/2 chain and the numerical diagonalization on the spin-1, spin-3/2, and spin-2 chains support this prediction.
Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.