SEARCH · Engineering Papers
Results for “execution model”
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.
Comparison of Doubly-Fed Induction Generator Machine Models for Real-Time Simulations
This work presents a detailed comparison among three implementations of the Doubly-Fed Induction Generator (DFIG) machine model. The alpha-beta-gamma, synchronous (dqo), and natural frame dynamic machine models were deployed on a Field-Programmable Gate Array (FPGA) and compared in terms of execution time and resource utilization. These machine models were also validated against a physical DFIG machine during balanced and unbalanced grid conditions. A benchmark is presented with the objective of selecting the machine model, orientation and state-space representation that is best suited for real-time simulations. The selected machine model is used to develop a real-time emulator of a Type-3 wind system. This emulator enables the study of wind turbine system in realtime using a validated platform while allowing controller testing without relying on expensive third-party solutions.
Digital simulation of the serpentuator using MARSYAS
Serpentuator is a serpentine teleoperator device for intravehicular and extravehicular activities in space. The serpentuator is simulated using simulation software system MARSYAS and using the Component-Connection Simulation model and the Direct Simulation model. A comparison of the results for the two cases shows that under identical conditions, simulation execution time in the Component-Connection model case is reduced by a factor of the order of 100. A visual display of the serpentuator positions is obtained using the AMTRAN system on the Datacraft DC 6024 computer.
The DaveMLTranslator: An Interface for DAVE-ML Aerodynamic Models
It can take weeks or months to incorporate a new aerodynamic model into a vehicle simulation and validate the performance of the model. The Dynamic Aerospace Vehicle Exchange Markup Language (DAVE-ML) has been proposed as a means to reduce the time required to accomplish this task by defining a standard format for typical components of a flight dynamic model. The purpose of this paper is to describe an object-oriented C++ implementation of a class that interfaces a vehicle subsystem model specified in DAVE-ML and a vehicle simulation. Using the DaveMLTranslator class, aerodynamic or other subsystem models can be automatically imported and verified at run-time, significantly reducing the elapsed time between receipt of a DAVE-ML model and its integration into a simulation environment. The translator performs variable initializations, data table lookups, and mathematical calculations for the aerodynamic build-up, and executes any embedded static check-cases for verification. The implementation is efficient, enabling real-time execution. Simple interface code for the model inputs and outputs is the only requirement to integrate the DaveMLTranslator as a vehicle aerodynamic model. The translator makes use of existing table-lookup utilities from the Langley Standard Real-Time Simulation in C++ (LaSRS++). The design and operation of the translator class is described and comparisons with existing, conventional, C++ aerodynamic models of the same vehicle are given.
Model Checking - My 27-Year Quest to Overcome the State Explosion Problem
Model Checking is an automatic verification technique for state-transition systems that are finite=state or that have finite-state abstractions. In the early 1980 s in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we proposed that Model Checking could be used for verifying concurrent systems and gave algorithms for this purpose. At roughly the same time, Joseph Sifakis and his student J.P. Queille at the University of Grenoble independently developed a similar technique. Model Checking has been used successfully to reason about computer hardware and communication protocols and is beginning to be used for verifying computer software. Specifications are written in temporal logic, which is particularly valuable for expressing concurrency properties. An intelligent, exhaustive search is used to determine if the specification is true or not. If the specification is not true, the Model Checker will produce a counterexample execution trace that shows why the specification does not hold. This feature is extremely useful for finding obscure errors in complex systems. The main disadvantage of Model Checking is the state-explosion problem, which can occur if the system under verification has many processes or complex data structures. Although the state-explosion problem is inevitable in worst case, over the past 27 years considerable progress has been made on the problem for certain classes of state-transition systems that occur often in practice. In this talk, I will describe what Model Checking is, how it works, and the main techniques that have been developed for combating the state explosion problem.
Flight dynamics analysis and simulation of heavy lift airships. Volume 1: Executive summary
A generic, yet comprehensive mathematical model and computer simulation of the HLA flight dynamics over its entire flight envelope was developed. Implicit in this simulation development are the data reviews and analyses which support the equations of motion and the calculation of forces and moments acting on the vehicle. The simulation, HYBRDS, is addressed to the broad requirements and is intended for use as a synthesis and analysis tool for the evaluation of competing HLA design concepts.
Software Development Cost Estimation Executive Summary
Identify simple fully validated cost models that provide estimation uncertainty with cost estimate. Based on COCOMO variable set. Use machine learning techniques to determine: a) Minimum number of cost drivers required for NASA domain based cost models; b) Minimum number of data records required and c) Estimation Uncertainty. Build a repository of software cost estimation information. Coordinating tool development and data collection with: a) Tasks funded by PA&E Cost Analysis; b) IV&V Effort Estimation Task and c) NASA SEPG activities.
Wave and Offshore Wind Resource in the U.S. Pacific Ocean Minor Outlying Islands
Coastal environments such as islands have unique opportunities for renewable energy resources. This work explores the wave and offshore wind energy potential for the U.S. Pacific Ocean Minor Outlying Islands, including Baker Island, Howland Island, Jarvis Island, Johnston Atoll, Kingman Reef, Palmyra Atoll, and Wake Island. A numerical wave model based on WAVEWATCH III and SWAN (both are NWS / NOAA models) was developed, validated, and executed to generate a 32-year hindcast dataset suitable for resource characterization for each island. A complementary offshore wind resource characterization is provided for the same time period based on the European Centre for Medium-Range Weather Forecasts (ECMWF) Reanalysis v5 (ERA5). Each island has five netcdf files: 1. wave_[island]_annual_J_map.nc: the data used to generate the map of annual averaged omnidirectional wave power (J [kW/m]) 2. wave_[island]_100m_IEC: six IEC parameters at 100m isobath from 1979/01/01 to 2020/12/31, output hourly 3. wave_[island]_5km_IEC: six IEC parameters at 5km from the shoreline 1979/01/01 to 2020/12/31, output hourly 4. wind_island_100mASL_windspeed_timeseries.nc: wind speed timeseries from ERA5 at 100 m above sea level within a 60 km radius of the island (m/s) 1979/01/01 to 2010/12/31, output hourly 5. wind_island_100mASL_winddirection_timeseries.nc: wind direction timeseries from ERA5 at 100 m above sea level within a 60 km radius of the island (degrees) 1979/01/01 to 2010/12/31, output hourly
Optimal checkpointing of real-time tasks
Analytical models for the design and evaluation of checkpointing of real-time tasks are developed. First, the execution of a real-time task is modeled under a common assumption of perfect coverage of on-line detection mechanisms (which is termed a basic model). Then, the model is generalized (to an extended model) to include more realistic cases, i.e., imperfect coverages of on-line detection mechanisms and acceptance tests. Finally, an optimal placement of checkpoints is determined to minimize the mean task execution time while the probability of an unreliable result (or lack of confidence) is kept below a specified level. In the basic model, it is shown that equidistant intercheckpoint intervals are optimal, whereas this is not necessarily true in the extended model. An algorithm for calculating the optimal number of checkpoints and intercheckpoint intervals is presented with some numerical examples for the extended model.
Identifying Executable Plans
Generating plans for execution imposes a different set of requirements on the planning process than those imposed by planning alone. In highly unpredictable execution environments, a fully-grounded plan may become inconsistent frequently when the world fails to behave as expected. Intelligent execution permits making decisions when the most up-to-date information is available, ensuring fewer failures. Planning should acknowledge the capabilities of the execution system, both to ensure robust execution in the face of uncertainty, which also relieves the planner of the burden of making premature commitments. We present Plan Identification Functions (PIFs), which formalize what it means for a plan to be executable, md are used in conjunction with a complete model of system behavior to halt the planning process when an executable plan is found. We describe the implementation of plan identification functions for a temporal, constraint-based planner. This particular implementation allows the description of many different plan identification functions. characteristics crf the ~xec~~tieonfvii r~nm-enft,h e best plan to hand to the execution system will contain more or less commitment and information.
Toward a Model-Based Approach for Flight System Fault Protection
Use SysML/UML to describe the physical structure of the system This part of the model would be shared with other teams - FS Systems Engineering, Planning & Execution, V&V, Operations, etc., in an integrated model-based engineering environment Use the UML Profile mechanism, defining Stereotypes to precisely express the concepts of the FP domain This extends the UML/SysML languages to contain our FP concepts Use UML/SysML, along with our profile, to capture FP concepts and relationships in the model Generate typical FP engineering products (the FMECA, Fault Tree, MRD, V&V Matrices)
Space Shuttle and Launch Pad Computational Fluid Dynamics Model for Lift-off Debris Transport Analysis
This paper discusses the Space Shuttle Lift-off CFD model developed for potential Lift-off Debris transport for return-to-flight. The Lift-off portion of the flight is defined as the time starting with tanking of propellants until tower clear, approximately T0+6 seconds, where interactions with the launch pad cease. A CFD model containing the Space Shuttle and launch Pad geometry has been constructed and executed. Simplifications required in the construction of the model are presented and discussed. A body-fitted overset grid of up to 170 million grid points was developed which allowed positioning of the Vehicle relative to the Launch Pad over the first six seconds of Climb-Out. The CFD model works in conjunction with a debris particle transport model and a debris particle impact damage tolerance model. These models have been used to assess the interactions of the Space Shuttle plumes, the wind environment, and their interactions with each other and the Launch Pad and their ultimate effect on potential debris during Lift-off.
The ATAMM procedure model for concurrent processing of large grained control and signal processing algorithms
An overview is presented of a model for describing data and control flow associated with the execution of large-grained, decision-free algorithms in a special distributed computer environment. The ATAMM (Algorithm-To-Architecture Mapping Model) model provides a basis for relating an algorithm to its execution in a dataflow multicomputer environment. The ATAMM model features a marked graph Petri net description of the algorithm behavior with regard to both data and control flow. The model provides an analytical basis for calculating performance bounds on throughput characteristics which are demonstrated here.
Analysis of multigrid methods on massively parallel computers: Architectural implications
We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether presently envisioned machines will provide an efficient platform for such algorithms. We consider the domain parallel version of the standard V cycle algorithm on model problems, discretized using finite difference techniques in two and three dimensions on block structured grids of size 10(exp 6) and 10(exp 9), respectively. Our models of parallel computation were developed to reflect the computing characteristics of the current generation of massively parallel multicomputers. These models are based on an interconnection network of 256 to 16,384 message passing, 'workstation size' processors executing in an SPMD mode. The first model accomplishes interprocessor communications through a multistage permutation network. The communication cost is a logarithmic function which is similar to the costs in a variety of different topologies. The second model allows single stage communication costs only. Both models were designed with information provided by machine developers and utilize implementation derived parameters. With the medium grain parallelism of the current generation and the high fixed cost of an interprocessor communication, our analysis suggests an efficient implementation requires the machine to support the efficient transmission of long messages, (up to 1000 words) or the high initiation cost of a communication must be significantly reduced through an alternative optimization technique. Furthermore, with variable length message capability, our analysis suggests the low diameter multistage networks provide little or no advantage over a simple single stage communications network.
Monte Carlo Simulations of the Formation Flying Dynamics for the Magnetospheric Multiscale (MMS) Mission
The MMS mission is an ambitious space physics mission that will fly 4 spacecraft in a tetrahedron formation in a series of highly elliptical orbits in order to study magnetic reconnection in the Earth's magnetosphere. The mission design is comprised of a combination of deterministic orbit adjust and random maintenance maneuvers distributed over the 2.5 year mission life. Formal verification of the requirements is achieved by analysis through the use of the End-to-End (ETE) code, which is a modular simulation of the maneuver operations over the entire mission duration. Error models for navigation accuracy (knowledge) and maneuver execution (control) are incorporated to realistically simulate the possible maneuver scenarios that might be realized These error models, coupled with the complex formation flying physics, lead to non-trivial effects that must be taken into account by the ETE automation. Using the ETE code, the MMS Flight Dynamics team was able to demonstrate that the current mission design satisfies the mission requirements.
Crash Simulation of a Vertical Drop Test of a Commuter-Class Aircraft
A finite element model of an ATR42-300 commuter-class aircraft was developed and a crash simulation was executed. Analytical predictions were correlated with data obtained from a 30-ft/s (9.14-m/s) vertical drop test of the aircraft. The purpose of the test was to evaluate the structural response of the aircraft when subjected to a severe, but survivable, impact. The aircraft was configured with seats, dummies, luggage, and other ballast. The wings were filled with 8,700 lb. (3,946 kg) of water to represent the fuel. The finite element model, which consisted of 57,643 nodes and 62,979 elements, was developed from direct measurements of the airframe geometry. The seats, dummies, luggage, fuel, and other ballast were represented using concentrated masses. The model was executed in LS-DYNA, a commercial code for performing explicit transient dynamic simulations. Predictions of structural deformation and selected time-history responses were generated. The simulation was successfully validated through extensive test-analysis correlation.
Test-Analysis Correlation of a Crash Simulation of a Vertical Drop Test of a Commuter-Category Aircraft
A finite element model of an ATR42-300 commuter-class aircraft was developed and a crash simulation was executed. Analytical predictions were correlated with data obtained from a 30-feet per second (9.14-meters per second) vertical drop test of the aircraft. The purpose of the test was to evaluate the structural response of the aircraft when subjected to a severe, but survivable, impact. The aircraft was configured with seats, dummies, luggage, and other ballast. The wings were filled with 8,700 lb. (3,946 kilograms) of water to represent the fuel. The finite element model, which consisted of 57,643 nodes and 62,979 elements, was developed from direct measurements of the airframe geometry. The seats, dummies, luggage, simulated engines and fuel, and other ballast were represented using concentrated masses. The model was executed in LS-DYNA, a commercial finite element code for performing explicit transient dynamic simulations. Analytical predictions of structural deformation and selected time-history responses were correlated with experimental data from the drop test to validate the simulation.
Environment Modeling Using Runtime Values for JPF-Android
Software applications are developed to be executed in a specific environment. This environment includes external native libraries to add functionality to the application and drivers to fire the application execution. For testing and verification, the environment of an application is simplified abstracted using models or stubs. Empty stubs, returning default values, are simple to generate automatically, but they do not perform well when the application expects specific return values. Symbolic execution is used to find input parameters for drivers and return values for library stubs, but it struggles to detect the values of complex objects. In this work-in-progress paper, we explore an approach to generate drivers and stubs based on values collected during runtime instead of using default values. Entry-points and methods that need to be modeled are instrumented to log their parameters and return values. The instrumented applications are then executed using a driver and instrumented libraries. The values collected during runtime are used to generate driver and stub values on- the-fly that improve coverage during verification by enabling the execution of code that previously crashed or was missed. We are implementing this approach to improve the environment model of JPF-Android, our model checking and analysis tool for Android applications.