Search NASASearch

SEARCH · Search NASA

Results for “Checking”

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 55 records · Page 3

Temporal Precedence Checking for Switched Models and its Application to a Parallel Landing Protocol

This paper presents an algorithm for checking temporal precedence properties of nonlinear switched systems. This class of properties subsume bounded safety and capture requirements about visiting a sequence of predicates within given time intervals. The algorithm handles nonlinear predicates that arise from dynamics-based predictions used in alerting protocols for state-of-the-art transportation systems. It is sound and complete for nonlinear switch systems that robustly satisfy the given property. The algorithm is implemented in the Compare Execute Check Engine (C2E2) using validated simulations. As a case study, a simplified model of an alerting system for closely spaced parallel runways is considered. The proposed approach is applied to this model to check safety properties of the alerting logic for different operating conditions such as initial velocities, bank angles, aircraft longitudinal separation, and runway separation.

Duggirala, Parasara Sridhar

Prediction Interval Development for Wind-Tunnel Balance Check-Loading

Results from the Facility Analysis Verification and Operational Reliability project revealed a critical gap in capability in ground-based aeronautics research applications. Without a standardized process for check-loading the wind-tunnel balance or the model system, the quality of the aerodynamic force data collected varied significantly between facilities. A prediction interval is required in order to confirm a check-loading. The prediction interval provides an expected upper and lower bound on balance load prediction at a given confidence level. A method has been developed which accounts for sources of variability due to calibration and check-load application. The prediction interval method of calculation and a case study demonstrating its use is provided. Validation of the methods is demonstrated for the case study based on the probability of capture of confirmation points.

Landman, Drew

Expansion of Check-Cases for 6DOF Simulation: Appendix A

This is the Appendix containing figures of simulation output data plots for comparison from the assessment, “Expansion of Check-Cases for 6DOF Simulation”. This effort expands upon a previous NASA activity that developed flight simulation benchmark check-cases to include new check-cases for the Cislunar domain, comparing multiple NASA simulation tools. The results of this effort describe the benefits of standardizing inputs, simulation comparisons and describe an interactive website that enables comparison of externally provided simulation data. Participating simulations improved their software and identified implementation errors. This activity elevated simulation credibility and provided a measure of validation for the simulations actively in use for NASA’s Human Landing Systems (HLS).

Modeling

New Challenges in Model Checking

In the last 25 years, the notion of performing software verification with logic model checking techniques has evolved from intellectual curiosity to accepted technology with significant potential for broad practical application. In this paper we look back at the main steps in this evolution and illustrate how the challenges have changed over the years, as we sharpened our theories and tools. Next we discuss a typical challenge in software verification that we face today - and that perhaps we can look back on in another 25 years as having inspired the next logical step towards a broader integration of model checking into the software development process.

software verification

Low-Density Parity-Check Codes as Stable Phases of Quantum Matter

Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a stable gapped quantum phase of matter, whose ground-state degeneracy is robust against perturbations in the thermodynamic limit? We prove that a low-density parity-check (LDPC) code defines such a phase, robust against all few-body perturbations, if its code distance grows at least logarithmically in the number of degrees of freedom, and it exhibits “check soundness.” Many constant-rate quantum LDPC expander codes have such properties, and define stable phases of matter with a constant zero-temperature entropy density, violating the third law of thermodynamics. Our results also show that quantum toric-code phases are robust to spatially nonlocal few-body perturbations. Similarly, phases of matter defined by classical codes are stable against symmetric perturbations. In the classical setting, we present improved locality bounds on the quasiadiabatic evolution operator between two nearby states in the same code phase.

quantum error correction

Idiomatic Correctness-Checking via Julienne in Fortran 2023

This paper presents a unified approach to unit testing and runtime assertion checking using Fortran 2023. The paper describes the support for our approach in the Julienne framework. Julienne leverages recent Fortran standards to implement object-oriented design patterns, support testing parallel programs, and implement functional programming patterns in order to craft idioms inspired by natural-language expressions. The presented idioms employ novel operators to write expressions that evaluate to a test-diagnosis object encapsulating two components: (1) the test outcome or assertion outcome and (2) an automatically generated diagnostic string. Two other novel aspects of the approach include (1) the ability to enforce assertions inside pure procedures and (2) the ability to output rich diagnostic information inside pure procedures during error termination when assertions fail. The latter capability mitigates against a reason that Fortran programmers commonly cite for not writing pure procedures: difficulty obtaining useful program output inside pure procedures when debugging code. This paper demonstrates how the adoption of the proposed idioms leads naturally to a unifying theme across two otherwise disparate technologies: unit testing and runtime assertion checking. Finally, this paper describes the usage of the Julienne testing framework for writing unit tests and assertions in the Matcha high-performance computing application and the Fiats deep learning library.

Rouson, Damian

Fluid check valve has fail-safe feature

Check valve ensures unidirectional fluid flow and, in case of failure, vents the downstream fluid to the atmosphere and gives a positive indication of malfunction. This dual valve consists of a master check valve and a fail-safe valve.

Gaul, L. C.

Solenoid-operated swing-check valve

Modification of spring-loaded swing-check valve for solenoid operation provides low-vacuum swing-check valve which can be operated remotely.

Quattrone, P. D.

Method and apparatus for checking fire detectors

A fire detector checking method and device are disclosed for nondestructively verifying the operation of installed fire detectors of the type which operate on the principle of detecting the rate of temperature rise of the ambient air to sound an alarm and/or which sound an alarm when the temperature of the ambient air reaches a preset level. The fire alarm checker uses the principle of effecting a controlled simulated alarm condition to ascertain wheather or not the detector will respond. The checker comprises a hand-held instrument employing a controlled heat source, e.g., an electric lamp having a variable input, for heating at a controlled rate an enclosed mass of air in a first compartment, which air mass is then disposed about the fire detector to be checked. A second compartment of the device houses an electronic circuit to sense and adjust the temperature level and heating rate of the heat source.

Clawson, G. T.

Space shuttle prototype check valve development

Contaminant-resistant seal designs and a dynamically stable prototype check valve for the orbital maneuvering and reaction control helium pressurization systems of the space shuttle were developed. Polymer and carbide seal models were designed and tested. Perfluoroelastomers compatible with N2O4 and N2H4 types were evaluated and compared with Teflon in flat and captive seal models. Low load sealing and contamination resistance tests demonstrated cutter seal superiority over polymer seals. Ceramic and carbide materials were evaluated for N2O4 service using exposure to RFNA as a worst case screen; chemically vapor deposited tungsten carbide was shown to be impervious to the acid after 6 months immersion. A unique carbide shell poppet/cutter seat check valve was designed and tested to demonstrate low cracking pressure ( 2.0 psid), dynamic stability under all test bench flow conditions, contamination resistance (0.001 inch CRES wires cut with 1.5 pound seat load) and long life of 100,000 cycles (leakage 1.0 scc/hr helium from 0.1 to 400 psig).

Tellier, G. F.

Chemical vapor deposited tungsten with dispersed carbides for Space Shuttle check valves

A chemical vapor deposited tungsten with dispersed carbides was selected as the material for Space Shuttle Orbital Maneuvering and Reaction Control Systems check valve poppets and seats. The selection followed a NASA-sponsored prototype check valve development program utilizing the cutter-seal shell poppet concept. The poppet material is deposited as a coating approximately 0.9 mm thick and fabricated into a shell as a free standing body. The seat material is deposited as a coating 1.1 mm thick on a seat blank, and the cutter seal is machined in the coating. Module tests demonstrated that the material could be ground and lapped to very sharp edges and could cut through typical system contaminants without excessive damage to the sealing surfaces. The material was also determined to be unaffected by exposure to a strongly oxidizing storable propellant.

Williams, G. E.

On implementing self-checking microprocessors

A simple and general model of the interfaces and check circuits used for comparing and detecting faults in a pair of 16-bit processors is described, and problems encountered in the application of TI 9900 processors are discussed. The greatest incompatibility is found to lie between the rollback structures of the CPUs and the interface and check logic (ICL) model. The ICL model generates a reset when an error is detected, and a rollback is expected to occur when it is released. The TI 9900 requires a reset of minimum duration, and after release goes through an initialization cycle, obtains rollback parameters from fixed memory locations, and executes the rollback, consistent with the ICL. The ICL is relatively simple, having a complexity equivalent to fewer than 1000 gates.

Rennels, D. A.

A voice-actuated wind tunnel model leak checking system

A voice-actuated wind tunnel model leak checking system was developed. The system uses a voice recognition and response unit to interact with the technician along with a graphics terminal to provide the technician with visual feedback while checking a model for leaks.

Larson, W. E.

Joule-Thomson Expander Without Check Valves

Cooling effected by bidirectional, reciprocating flow of gas. Type of Joule-Thomson (J-T) expander for cryogenic cooling requires no check valves to prevent reverse flow of coolant. More reliable than conventional J-T expander, containing network of check valves, each potential source of failure. Gas flows alternately from left to right and right to left. Heat load cooled by evaporation of liquid from left or right compartment, whichever at lower pressure.

Chan, C. K.

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.