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 379 records · Page 21

Singular Perturbation-Based Large-Signal Order Reduction of Microgrids for Stability and Accuracy Synthesis With Control

The increasing penetration of distributed energy resources (DERs) highlights the growing importance of microgrids (MGs) in enhancing power system reliability. Employing electromagnetic transient (EMT) analysis in MGs becomes crucial for controlling the rapid transients. However, this requires an accurate but high-order model of power electronics and their underlying control loops, complexifying the stability analysis from the viewpoint of a higher control level. To overcome these challenges, this paper proposes a large-signal order reduction (LSOR) method for MGs with considerations of external control inputs and the detailed dynamics of underlying control levels based on singular perturbation theory (SPT). Specially, we innovatively proposed and strictly proved a general stability and accuracy assessment theorem that allows us to analyze the dynamic stability of a full-order nonlinear system by only leveraging our derived reduced-order model (ROM) and boundary layer model (BLM). Furthermore, this theorem furnishes a set of conditions that determine the accuracy of the developed ROM. Lastly, by embedding such a theorem into the SPT, we propose a novel LSOR approach with guaranteed accuracy and stability analysis equivalence. Case studies are conducted on MG systems to show the effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Polarized Substructural Session Types

Concurrent processes can be extremely difficult to reason about, both for programmers and formally. One approach to coping with this difficulty is to study new programming languages and type features such as Session Types. Session types take as their conceptual notion of concurrency as a collection of processes linked together via channels and provide type-level coordination between processes using these channels. Logically motivated programming languages exploit the idea that providing a proof of a theorem in a logic is similar to proving that a given term has a particular type in a programming language and vice versa. These connections can be interesting for a few different reasons. First, when language and logic are independently discovered and independently useful, the existence of a connection suggests that both are onto some fundamentally important idea. Additionally, a connection provides a basis both for sanity checking our ideas and also can be fruitful grounds for inspiration by seeing how variants of either the logic or the language are reflected through the connection. This thesis primarily describes an exploration of logically motivated session types, SILL. Polarization, classifying propositions as either positive or negative, provides a natural way to describe a logically based session typing language with asynchronous communication while retaining a semantics that is reasonably implementable. Additionally, polarization gives us a way to smoothly integrate synchronous channels into SILL without needing a semantic extension. When combined with Adjoint Logic, this gives us an ability to incorporate a variety of modalities with relatively little work. From a practical perspective, this gives SILL access to persistent processes and garbage collection. We additionally explore a trio of loosely related extensions to SILL, and their logical connections, inspired by the above results: bundled message passing to reduce the number of communications performed by processes; racy programs, enabled by a select/epoll-like mechanism; and asynchronous receiving, an almost generalization of the basic asynchronous semantics. We have three different implementations of SILL: a simple but relatively full featured interpreter written in OCaml; a fragment of SILL as an embedded domain specific language in Haskell; and a cleaner version of the same in Idris. Lastly, we show that Liquid Types and Session Types are compatible. This gives us one notion of a dependently session typed language.

97 MATHEMATICS AND COMPUTING↗

Tamper-indicating quantum optical seals

Confidence in the means for identifying when tampering occurs is critical for containment and surveillance technologies. Fiber-optic seals have proven especially useful for actively surveying large areas or inventories due to the extended transmission range and flexible layout of fiber. However, it is reasonable to suspect that an intruder could tamper with a fiber-optic sensor by accurately replicating the light transmitted through the fiber. In this contribution, we demonstrate a novel approach to using fiber-optic seals for safeguarding large-scale inventories with increased confidence in the state of the seal. Our approach is based on the use of quantum mechanical phenomena to offer unprecedented surety in the authentication of the seal state. In particular, we show how quantum entangled photons can be used to monitor the integrity of a fiber-optic cable - the entangled photons serve as active sensing elements whose non-local correlations indicate normal seal operation. Moreover, we prove using the quantum no-cloning theorem that attacks against the quantum seal necessarily disturb its state and that these disturbances are immediately detected. Our quantum approach to seal authentication is based on physical principles alone and does not require the use of secret or proprietary information to ensure proper operation. We demonstrate an implementation of the quantum seal using a pair of entangled photons and we summarize our experimental results including the probability of detecting intrusions and the overall stability of the system design. We conclude by discussing the use of both free-space and fiber-based quantum seals for surveying large areas and inventories.

quantum information↗

An extension of the Laplace transform to Schwartz distributions

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.

Price, D. R.↗

Hohenberg-Kohn theorems in electrostatic and uniform magnetostatic fields

The Hohenberg-Kohn (HK) theorems of bijectivity between the external scalar potential and the gauge invariant nondegenerate ground state density, and the consequent Euler variational principle for the density, are proved for arbitrary electrostatic field and the constraint of fixed electron number. The HK theorems are generalized for spinless electrons to the added presence of an external uniform magnetostatic field by introducing the new constraint of fixed canonical orbital angular momentum. Thereby, a bijective relationship between the external scalar and vector potentials, and the gauge invariant nondegenerate ground state density and physical current density, is proved. A corresponding Euler variational principle in terms of these densities is also developed. These theorems are further generalized to electrons with spin by imposing the added constraint of fixed canonical orbital and spin angular momenta. The proofs differ from the original HK proof and explicitly account for the many-to-one relationship between the potentials and the nondegenerate ground state wave function. A Percus-Levy-Lieb constrained-search proof expanding the domain of validity to N-representable functions, and to degenerate states, again for fixed electron number and angular momentum, is also provided.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A universal measure for a pencil of conics and the Great Poncelet Theorem

Borel measures on conics which are invariant under the Poncelet map are investigated. For a pencil of conics the existence of a universal measure, which is invariant with respect to each conic in the pencil, is proved. Using this measure a new proof of the Great Poncelet Theorem is given. A full description of invariant Borel measures is also presented. Bibliography: 10 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

A Consistent BGK Model with Velocity-Dependent Collision Frequency for Gas Mixtures

Abstract We derive a multi-species BGK model with velocity-dependent collision frequency for a non-reactive, multi-component gas mixture. The model is derived by minimizing a weighted entropy under the constraint that the number of particles of each species, total momentum, and total energy are conserved. We prove that this minimization problem admits a unique solution for very general collision frequencies. Moreover, we prove that the model satisfies an H-Theorem and characterize the form of equilibrium.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Generalization of the Theorem on Forming a Matroid from Parts

The following generalization of the theorem on forming a matroid from parts is proved: If a finite set is subdivided into some blocks, each of which is supplied with a matroid structure, and the ranks of every union of certain blocks are prescribed and satisfy the conditions on the rank function of a matroid, then the rank function can be extended to all the subsets of the original set in such a way that the latter becomes a matroid.

97 MATHEMATICS AND COMPUTING↗

Graded Quotient Rings

This survey is based on the PhD Thesis that was defended at the Dissertation council of the Faculty of Mechanics and Mathematics of Moscow State University on December 6, 2013. This paper is devoted to the study of quotient rings of rings graded by a group. Graded analogs of the Faith–Utumi theorem of orders of matrix rings and Goldie’s theorems of orders of completely reducible rings are proved, and the orthogonal graded completion, which is an analog of the quotient ring underlying the orthogonal completion theory of Beidar–Mikhalev, is constructed.

97 MATHEMATICS AND COMPUTING↗

A new Uzawa method for fourth-order block saddle point problems

In this paper, we first propose a new Uzawa-SOR method for fourth-order block saddle point problems. Then we study its convergence conditions through some lemmas and theorems. Finally, the numerical results are presented to prove the 4-USOR method we proposed has less workload per iteration and higher accuracy for large linear system than the other Uzawa-type methods for solving the fourth-order block saddle point problem, which shows the effectiveness and feasibility of our method.

97 MATHEMATICS AND COMPUTING↗

Trigonometric polynomial approximation, K-functionals and generalized moduli of smoothness

Best approximation and approximation by families of linear polynomial operators (FLPO) in the spaces L{sub p}, 0<p⩽+∞, are investigated for periodic functions of an arbitrary number of variables in terms of the generalized modulus of smoothness generated by a periodic generator which, near the origin, is assumed to be close in a certain sense to some homogeneous function of positive order. Direct and inverse theorems (Jackson- and Bernstein-type estimates) are proved; conditions on the generators are obtained under which the approximation error by an FLPO is equivalent to an appropriate modulus of smoothness. These problems are solved by going over from the modulus to an equivalent K-functional. The general results obtained are applied to classical objects in the theory of approximation and smoothness. In particular, they are applied to the methods of approximation generated by Fejér, Riesz and Bochner-Riesz kernels, and also to the moduli of smoothness and K-functionals corresponding to the conventional, Weyl and Riesz derivatives and to the Laplace operator. Bibliography: 24 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Liapunov functions for non-linear difference equation stability analysis.

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.

Park, K. E.↗

Hierarchical Design and Verification for VLSI

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.

Shostak, R. E.↗

Verifying the interactive convergence clock synchronization algorithm using the Boyer-Moore 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.

Young, William D.↗

Statistical properties of three-dimensional two-fluid plasma model

The nonlinear dynamics of incompressible non-dissipative two-fluid plasma model is investigated through classical Gibbs ensemble methods. Liouville's theorem of phase space for each wave number is proved, and the absolute equilibrium spectra for Galerkin truncated two-fluid model are calculated. In two-fluid theory, the equilibrium is built on the conservation of three quadratic invariants: the total energy and the self-helicities for ions and electrons fluid, respectively. The implications of statistic equilibrium spectra with arbitrary ratios of conserved invariants are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Formalization of the Integral Calculus in the PVS Theorem 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.

Butler, Ricky W.↗