Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Constraint 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 109 records · Page 6

Observational evidence for various models of Moving Magnetic Features

New measurements of Moving Magnetic Features (MMFs) based on the observations of the active region NOAA 5612 made at Big Bear Solar Observatory (BBSO) on August 2, 1989 are presented. The existing theoretical models are checked against the new observations, and the origin of MMFs conjectured from the deduced observational constraints is discussed.

Lee, Jeongwoo W.↗

Using Model Checking to Validate AI Planner Domain Models

This report describes an investigation into using model checking to assist validation of domain models for the HSTS planner. The planner models are specified using a qualitative temporal interval logic with quantitative duration constraints. We conducted several experiments to translate the domain modeling language into the SMV, Spin and Murphi model checkers. This allowed a direct comparison of how the different systems would support specific types of validation tasks. The preliminary results indicate that model checking is useful for finding faults in models that may not be easily identified by generating test plans.

Penix, John↗

On the use of Graphs for Test Sequence Selection

This report demonstrates that applying graph theory techniques provides a way to obtain sufficient statistics in finding errors when testing complex state machines. It discusses how to define the tests, then demonstrates how to automatically generate test suites that diversify test cases, subject to constraints. If included within a continuous integration approach, these constructs provide an unbiased means to systematically check for errors within the latest controller software release.

97 MATHEMATICS AND COMPUTING↗

Experimental Evaluation of a Planning Language Suitable for Formal Verification

The marriage of model checking and planning faces two seemingly diverging alternatives: the need for a planning language expressive enough to capture the complexity of real-life applications, as opposed to a language simple, yet robust enough to be amenable to exhaustive verification and validation techniques. In an attempt to reconcile these differences, we have designed an abstract plan description language, ANMLite, inspired from the Action Notation Modeling Language (ANML) [17]. We present the basic concepts of the ANMLite language as well as an automatic translator from ANMLite to the model checker SAL (Symbolic Analysis Laboratory) [7]. We discuss various aspects of specifying a plan in terms of constraints and explore the implications of choosing a robust logic behind the specification of constraints, rather than simply propose a new planning language. Additionally, we provide an initial assessment of the efficiency of model checking to search for solutions of planning problems. To this end, we design a basic test benchmark and study the scalability of the generated SAL models in terms of plan complexity.

Butler, Rick W.↗

From Informal Safety-Critical Requirements to Property-Driven Formal Validation

Most of the efforts in formal methods have historically been devoted to comparing a design against a set of requirements. The validation of the requirements themselves, however, has often been disregarded, and it can be considered a largely open problem, which poses several challenges. The first challenge is given by the fact that requirements are often written in natural language, and may thus contain a high degree of ambiguity. Despite the progresses in Natural Language Processing techniques, the task of understanding a set of requirements cannot be automatized, and must be carried out by domain experts, who are typically not familiar with formal languages. Furthermore, in order to retain a direct connection with the informal requirements, the formalization cannot follow standard model-based approaches. The second challenge lies in the formal validation of requirements. On one hand, it is not even clear which are the correctness criteria or the high-level properties that the requirements must fulfill. On the other hand, the expressivity of the language used in the formalization may go beyond the theoretical and/or practical capacity of state-of-the-art formal verification. In order to solve these issues, we propose a new methodology that comprises of a chain of steps, each supported by a specific tool. The main steps are the following. First, the informal requirements are split into basic fragments, which are classified into categories, and dependency and generalization relationships among them are identified. Second, the fragments are modeled using a visual language such as UML. The UML diagrams are both syntactically restricted (in order to guarantee a formal semantics), and enriched with a highly controlled natural language (to allow for modeling static and temporal constraints). Third, an automatic formal analysis phase iterates over the modeled requirements, by combining several, complementary techniques: checking consistency; verifying whether the requirements entail some desirable properties; verify whether the requirements are consistent with selected scenarios; diagnosing inconsistencies by identifying inconsistent cores; identifying vacuous requirements; constructing multiple explanations by enabling the fault-tree analysis related to particular fault models; verifying whether the specification is realizable.

Cimatti, Alessandro↗

Joint Carrier-Phase Synchronization and LDPC Decoding

A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine and sine of the carrier phase cc as well as correlated noise components. These products would be fed as inputs to a digital PLL that would include a number-controlled oscillator (NCO), which provides an estimate of the carrier phase, theta(sub c).

Simon, Marvin↗

Variable-complexity aerodynamic-structural design of a high-speed civil transport wing

A variable-complexity strategy of combining simple and detailed analysis methods is presented for the design optimization of a high-speed civil transport (HSCT) wing. Two sets of results are shown: the aerodynamic design of the wing using algebraic weight equations for structural considerations, and optimization results of the internal wing structure for a fixed wing configuration. We show example results indicating that using simple analysis methods alone for the calculation of a critical constraint can allow an optimizer to exploit weaknesses in the analysis. The structural optimization results provide a valuable check for the weight equations used in the aerodynamic design. In addition, these results confirm the need for using simple, algebraic models in conjunction with more detailed analysis methods. A strategy of interlaced aerodynanic-structural design is proposed.

Hutchison, M. G.↗

Request for Information Response for the Flight Validation of Adaptive Control to Prevent Loss-of-Control Events. Overview of RFI Responses

Adaptive control should be integrated with a baseline controller and only used when necessary (5 responses). Implementation as an emergency system. Immediately re-stabilize and return to controlled flight. Forced perturbation (excitation) for fine-tuning system a) Check margins; b) Develop requirements for amplitude of excitation. Adaptive system can improve performance by eating into margin constraints imposed on the non-adaptive system. Nonlinear effects due to multi-string voting.

Bosworth, John T.↗

Checking Flight Rules with TraceContract: Application of a Scala DSL for Trace Analysis

Typically during the design and development of a NASA space mission, rules and constraints are identified to help reduce reasons for failure during operations. These flight rules are usually captured in a set of indexed tables, containing rule descriptions, rationales for the rules, and other information. Flight rules can be part of manual operations procedures carried out by humans. However, they can also be automated, and either implemented as on-board monitors, or as ground based monitors that are part of a ground data system. In the case of automated flight rules, one considerable expense to be addressed for any mission is the extensive process by which system engineers express flight rules in prose, software developers translate these requirements into code, and then both experts verify that the resulting application is correct. This paper explores the potential benefits of using an internal Scala DSL for general trace analysis, named TRACECONTRACT, to write executable specifications of flight rules. TRACECONTRACT can generally be applied to analysis of for example log files or for monitoring executing systems online.

temporal logic↗

Proceedings of the Second NASA Formal Methods Symposium

This publication contains the proceedings of the Second NASA Formal Methods Symposium sponsored by the National Aeronautics and Space Administration and held in Washington D.C. April 13-15, 2010. Topics covered include: Decision Engines for Software Analysis using Satisfiability Modulo Theories Solvers; Verification and Validation of Flight-Critical Systems; Formal Methods at Intel -- An Overview; Automatic Review of Abstract State Machines by Meta Property Verification; Hardware-independent Proofs of Numerical Programs; Slice-based Formal Specification Measures -- Mapping Coupling and Cohesion Measures to Formal Z; How Formal Methods Impels Discovery: A Short History of an Air Traffic Management Project; A Machine-Checked Proof of A State-Space Construction Algorithm; Automated Assume-Guarantee Reasoning for Omega-Regular Systems and Specifications; Modeling Regular Replacement for String Constraint Solving; Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol; Can Regulatory Bodies Expect Efficient Help from Formal Methods?; Synthesis of Greedy Algorithms Using Dominance Relations; A New Method for Incremental Testing of Finite State Machines; Verification of Faulty Message Passing Systems with Continuous State Space in PVS; Phase Two Feasibility Study for Software Safety Requirements Analysis Using Model Checking; A Prototype Embedding of Bluespec System Verilog in the PVS Theorem Prover; SimCheck: An Expressive Type System for Simulink; Coverage Metrics for Requirements-Based Testing: Evaluation of Effectiveness; Software Model Checking of ARINC-653 Flight Code with MCP; Evaluation of a Guideline by Formal Modelling of Cruise Control System in Event-B; Formal Verification of Large Software Systems; Symbolic Computation of Strongly Connected Components Using Saturation; Towards the Formal Verification of a Distributed Real-Time Automotive System; Slicing AADL Specifications for Model Checking; Model Checking with Edge-valued Decision Diagrams; and Data-flow based Model Analysis.

Munoz, Cesar↗

Cosmological constraints from the cross-correlation of DESI Luminous Red Galaxies with CMB lensing from Planck PR4 and ACT DR6

Here, we infer the growth of large scale structure over the redshift range 0.4 ≲ z ≲ 1 from the cross-correlation of spectroscopically calibrated Luminous Red Galaxies (LRGs) selected from the Dark Energy Spectroscopic Instrument (DESI) legacy imaging survey with CMB lensing maps reconstructed from the latest Planck and ACT data. We adopt a hybrid effective field theory (HEFT) model that robustly regulates the cosmological information obtainable from smaller scales, such that our cosmological constraints are reliably derived from the (predominantly) linear regime. We perform an extensive set of bandpower- and parameter-level systematics checks to ensure the robustness of our results and to characterize the uniformity of the LRG sample. We demonstrate that our results are stable to a wide range of modeling assumptions, finding excellent agreement with a linear theory analysis performed on a restricted range of scales. From a tomographic analysis of the four LRG photometric redshift bins we find that the rate of structure growth is consistent with ΛCDM with an overall amplitude that is ≃ 5-7% lower than predicted by primary CMB measurements with modest (∼ 2σ) statistical significance. From the combined analysis of all four bins and their cross-correlations with Planck we obtain S 8 = 0.765 ± 0.023, which is less discrepant with primary CMB measurements than previous DESI LRG cross Planck CMB lensing results. From the cross-correlation with ACT we obtain S 8 = 0.790 +0.024 -0.027 , while when jointly analyzing Planck and ACT we find S 8 = 0.775 +0.019 -0.022 from our data alone and σ 8 = 0.772 +0.020 -0.023 with the addition of BAO data. These constraints are consistent with the latest Planck primary CMB analyses at the ≃ 1.6-2.2σ level, and are in excellent agreement with galaxy lensing surveys.

cosmological parameters from LSS↗

Kepler and Ground-Based Transits of the exo-Neptune HAT-P-11b

We analyze 26 archival Kepler transits of the exo-Neptune HAT-P-11b, supplemented by ground-based transits observed in the blue (B band) and near-IR (J band). Both the planet and host star are smaller than previously believed; our analysis yields Rp = 4.31 R xor 0.06 R xor and Rs = 0.683 R solar mass 0.009 R solar mass, both about 3 sigma smaller than the discovery values. Our ground-based transit data at wavelengths bracketing the Kepler bandpass serve to check the wavelength dependence of stellar limb darkening, and the J-band transit provides a precise and independent constraint on the transit duration. Both the limb darkening and transit duration from our ground-based data are consistent with the new Kepler values for the system parameters. Our smaller radius for the planet implies that its gaseous envelope can be less extensive than previously believed, being very similar to the H-He envelope of GJ 436b and Kepler-4b. HAT-P-11 is an active star, and signatures of star spot crossings are ubiquitous in the Kepler transit data. We develop and apply a methodology to correct the planetary radius for the presence of both crossed and uncrossed star spots. Star spot crossings are concentrated at phases 0.002 and +0.006. This is consistent with inferences from Rossiter-McLaughlin measurements that the planet transits nearly perpendicular to the stellar equator. We identify the dominant phases of star spot crossings with active latitudes on the star, and infer that the stellar rotational pole is inclined at about 12 deg 5 deg to the plane of the sky. We point out that precise transit measurements over long durations could in principle allow us to construct a stellar Butterfly diagram to probe the cyclic evolution of magnetic activity on this active K-dwarf star.

Deming, Drake↗

Two-Season Atacama Cosmology Telescope Polarimeter Lensing Power Spectrum

We report a measurement of the power spectrum of cosmic microwave background (CMB) lensing from two seasons of Atacama Cosmology Telescope polarimeter (ACTPol) CMB data. The CMB lensing power spectrum is extracted from both temperature and polarization data using quadratic estimators. We obtain results that are consistent with the expectation from the best-fit Planck CDM model over a range of multipoles L 80-2100, with an amplitude of lensing A(sub lens) = 1.06 +/- 0.15 stat +/- 0.06 sys relative to Planck. Our measurement of the CMB lensing power spectrum gives sigma 8 omega m(sup 0.25) = 0.643 +/- 0.054; including baryon acoustic oscillation scale data, we constrain the amplitude of density fluctuations to be sigma 8 = 0.831 +/- 0.053. We also update constraints on the neutrino mass sum. We verify our lensing measurement with a number of null tests and systematic checks, finding no evidence of significant systematic errors. This measurement relies on a small fraction of the ACTPol data already taken; more precise lensing results can therefore be expected from the full ACTPol data set.

Shewin, Blake D.↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Models for Water Isotopes Constrained with Data from Crystal Face

During the year covered by this proposal we conducted work on several different topics, as reflected by our publications listed below. One major activity was to work with a group of about 10 scientists from around the country to prepare a science-planning document (Tropical Composition, Cloud and Climate Coupling Experiment (TC4)) that outlined the rationale, locations, strategy to accomplish the goals, and possible payloads for a set of three tropical missions. We also prepared background materials for various NRAs being prepared at NASA Headquarters for missions in Costa Rica, Darwin and Guam. Unfortunately budgetary constraints prevented these missions from moving forward. In conjunction with the group NASA Ames we built a new numerical model for deep convection and have applied that model to simulate the CRYSTAL isotope data. Our goal in particular has been to better understanding how convection distributes water vapor isotopes. CRYSTAL observations of water isotopes are very different from those suggested by previous workers who assumed the isotopes would obey Rayleigh fractionation. The water isotope study has several implications. First it is a check on the realism of the deep convection model. Second, the isotopes are a measure of the precipitation removal in the atmosphere. Hence they provide a constraint on a parameter that is difficult to otherwise measure. Finally it has been suggested that isotopes may be the key to unraveling the water transport into the stratosphere and upper troposphere. Such transport is critical both for the radiation balance and for stratospheric chemistry. Ours is the first model that is able to treat this transport. Our initial results are now in press in Geophys. Res. Lett. Essentially we are able to explain the vertical profiles of isotopes in the tropical tropopause transition layer. We are also able to account for stratospheric humidity ana isotope abundances with this model. The data suggest that isotopes do not provide a clear constraint on the mechanism by which water enters the stratosphere- whether by convection, or by slow ascent. Our work is relevant for the water isotope comparison experiments recently done by NASA. We are conducting numerical experiments related to this project to help understand that data.

Toon, Owen B.↗

Spaceborne Autonomous and Ground Based Relative Orbit Control for the TerraSAR-X/TanDEM-X Formation

TerraSAR-X (TSX) and TanDEM-X (TDX) are two advanced synthetic aperture radar (SAR) satellites flying in formation. SAR interferometry allows a high resolution imaging of the Earth by processing SAR images obtained from two slightly different orbits. TSX operates as a repeat-pass interferometer in the first phase of its lifetime and will be supplemented after two years by TDX in order to produce digital elevation models (DEM) with unprecedented accuracy. Such a flying formation makes indeed possible a simultaneous interferometric data acquisition characterized by highly flexible baselines with range of variations between a few hundreds meters and several kilometers [1]. TSX has been successfully launched on the 15th of June, 2007. TDX is expected to be launched on the 31st of May, 2009. A safe and robust maintenance of the formation is based on the concept of relative eccentricity/inclination (e/i) vector separation whose efficiency has already been demonstrated during the Gravity Recovery and Climate Experiment (GRACE) [2]. Here, the satellite relative motion is parameterized by mean of relative orbit elements and the key idea is to align the relative eccentricity and inclination vectors to minimize the hazard of a collision. Previous studies have already shown the pertinence of this concept and have described the way of controlling the formation using an impulsive deterministic control law [3]. Despite the completely different relative orbit control requirements, the same approach can be applied to the TSX/TDX formation. The task of TDX is to maintain the close formation configuration by actively controlling its relative motion with respect to TSX, the leader of the formation. TDX must replicate the absolute orbit keeping maneuvers executed by TSX and also compensate the natural deviation of the relative e/i vectors. In fact the relative orbital elements of the formation tend to drift because of the secular non-keplerian perturbations acting on both satellites. The goal of the ground segment is thus to regularly correct this configuration by performing small orbit correction maneuvers on TDX. The ground station contacts are limited due to the geographic position of the station and the costs for contact time. Only with a polar ground station a contact visibility is possible every orbit for LEO satellites. TSX and TDX use only the Weilheim ground station (in the southern part of Germany) during routine operations. This station allows two scheduled contact per day for the nominal orbit configuration, meaning that the satellite conditions can be checked with an interval of 12 hours. While this limitation is usually not critical for single satellite operations, the visibility constraints drive the achievable orbit control accuracy for a LEO formation if a ground based approach is chosen. Along-track position uncertainties and maneuver execution errors affect the relative motion and can be compensated only after a ground station contact.

Ardaens, J. S.↗

Cloud Condensation in Titan's Lower Stratosphere

A 1-D condensation model is developed for the purpose of reproducing ice clouds in Titan's lower stratosphere observed by the Composite Infrared Spectrometer (CIRS) onboard Cassini. Hydrogen cyanide (HCN), cyanoacetylene (HC3N), and ethane (C2H6) vapors are treated as chemically inert gas species that flow from an upper boundary at 500 km to a condensation sink near Titan's tropopause (-45 km). Gas vertical profiles are determined from eddy mixing and a downward flux at the upper boundary. The condensation sink is based upon diffusive growth of the cloud particles and is proportional to the degree of supersaturation in the cloud formation regIOn. Observations of the vapor phase abundances above the condensation levels and the locations and properties of the ice clouds provide constraints on the free parameters in the model. Vapor phase abundances are determined from CIRS mid-IR observations, whereas cloud particle sizes, altitudes, and latitudinal distributions are derived from analyses of CIRS far-IR observations of Titan. Specific cloud constraints include: I) mean particle radii of2-3 J.lm inferred from the V6 506 cm- band of HC3N, 2) latitudinal abundance distributions of condensed nitriles, inferred from a composite emission feature that peaks at 160/cm , and 3) a possible hydrocarbon cloud layer at high latitudes, located near an altitude of 60 km, which peaks between 60 and 80 cm l . Nitrile abundances appear to diminish substantially at high northern latitudes over the time period 2005 to 2010 (northern mid winter to early spring). Use of multiple gas species provides a consistency check on the eddy mixing coefficient profile. The flux at the upper boundary is the net column chemical production from the upper atmosphere and provides a constraint on chemical pathways leading to the production of these compounds. Comparison of the differing lifetimes, vapor phase transport, vapor phase loss rate, and particle sedimentation, sheds light on temporal stability of the clouds.

Romani, Paul N.↗