Using Executable SysML Models to Generate System Engineering Products
No abstract available
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.
No abstract available
A coupled hydrologic and snowpack stable water isotope model is used to assesses controls on isotopic inputs across the East River, Colorado, a large, mountainous basin. The hydrologic model uses the semi-empirical, spatially distributed and publicly available U.S. Geological Survey numerical code Precipitation-Modelling Runoff System (PRMS). Water and energy are tracked daily through the atmosphere, canopy and subsurface at a 100-m grid resolution. The isotope mass balance model follows previous work by Ala-aho et al. (2017) to track stable isotopes entering the soil system as snowmelt or rain. Water stores and fluxes needed for the isotope model use hydrologic model output for each timestep and model modeled grid location. This data package provides all files related to the hydrologic model (executable, input and output files), the isotopic model calibration and the historic isotopic model (water years 2015-2020). The isotope model source code and executable are provided. The file "readme.txt" includes information on the file structure, steps to run the model, and description of included folders.
DayCent data and results for:J. L. Field, T. L. Richard, E. A. Smithwick, H. Cai, M. S. Laser, D. S. LeBauer, S. P. Long, K. Paustian, Z. Qin, J. J. Sheehan, P. Smith, M. Q. Wang, L. R. Lynd, Robust paths to net greenhouse gas mitigation and negative emissions via advanced biofuels. Proceedings of the National Academy of Sciences (2020). https://doi.org/10.1073/pnas.1920877117 This zip file contains a UNIX-format DayCent model executable, input files, automation code, and associated directory structure necessary to re-produce the DayCent analysis underlying the manuscript. The main script 'autodaycent.py' (written for Python 2.7) opens an interactive command line routine that facilitates:* Calibrating the DayCent pine growth model.* Initializing DayCent for a set of case studies sites.* Executing an ensemble of model runs representing case study site reforestation, grassland restoration, or conversion to switchgrass cultivation. * Results analysis & generation of manuscript Fig. 3. Note that the interactive analysis code requires that all input files to be contained in the directory structure as uploaded, without modification. Executable versions of the DayCent model (https://www.nrel.colostate.edu/projects/daycent/) compatible with other operating systems are available upon request.Please send questions/comments to John.L.Field@gmail.com
This document outlines a Modeling and Analysis Plan (MAP) to be followed by the SBKF analysts. It includes instructions on modeling and analysis formulation and execution, model verification and validation, identifying sources of error and uncertainty, and documentation. The goal of this MAP is to provide a standardized procedure that ensures uniformity and quality of the results produced by the project and corresponding documentation.
Executable models can be used to support all engineering activities in Model-Based Systems Engineering. Testing and simulation of such models can provide early feedback about design choices. How-ever, in today’s complex systems failures could arise due to subtle errors that are hard to find without checking all possible execution paths. Formal methods, and especially model checking can uncover such subtle errors, yet their usage in practice is limited due to the specialized expertise and high computing power required. There-fore we created an automated, cloud-based environment that can verify complex reachability properties on SysML State Machines using hidden model checkers. The approach and the prototype is illustrated using an example from the aerospace domain.
Improper use of Inter-Process Communication (IPC) within concurrent systems often creates data races which can lead to bugs that are challenging to discover. Techniques that use Satisfiability Modulo Theories (SMT) problems to symbolically model possible executions of concurrent software have recently been proposed for use in the formal verification of software. In this work we describe a new technique for modeling executions of concurrent software that use a message passing API called MCAPI. Our technique uses an execution trace to create an SMT problem that symbolically models all possible concurrent executions and follows the same sequence of conditional branch outcomes as the provided execution trace. We check if there exists a satisfying assignment to the SMT problem with respect to specific safety properties. If such an assignment exists, it provides the conditions that lead to the violation of the property. We show how our method models behaviors of MCAPI applications that are ignored in previously published techniques.
This report describes a novel fault graph modeling language and a simulation tool for executing models specified in the language. The modeling language has three primary features that distinguish it from similar reliability analysis tools. These are (1) a random variable modeling several distinct outcomes of a single fault; (2) chains of faults in which one fault triggers another; and (3) time to fail sampled from probability distributions including positive normal, exponential, Weibull with a minimum, or immediate. These features are motivated by their use in a historical analysis of centrifuge reliability.
This software package offers a novel fault graph modeling language and a simulation tool for executing models specified in the language. The modeling language has three primary features that distinguish it from similar reliability analysis tools. These are (1) a random variable modeling several distinct outcomes of a single fault; (2) chains of faults in which one fault triggers another; and (3) time to fail sampled from probability distributions including positive normal, exponential, Weibull with a minimum, or immediate.
This zip file contains a UNIX-format DayCent model executable, input files, automation code, and associated directory structure necessary to re-produce the DayCent analysis underlying the manuscript. The main script “autodaycent.py” (written for Python 2.7) opens an interactive command line routine that facilitates: Calibrating the DayCent pine growth model; Initializing DayCent for a set of case studies sites; Executing an ensemble of model runs representing case study site reforestation, grassland restoration, or conversion to switchgrass cultivation; and Results analysis & generation of manuscript Fig. 3. Note that the interactive analysis code requires that all input files to be contained in the directory structure as uploaded, without modification. Executable versions of the DayCent model compatible with other operating systems are available upon request.
This data package contains hydrologic modeling input and output files for the East River (ER_PRMS.zip) and Copper Creek (CC_GSFLOW.zip) for water years 1987 to 2018. These data were used to generate simulated results published in Geophysical Research Letters (Carroll et al., 2019) describing the importance of interflow in generating groundwater recharge in the upper subalpine. The East River and Copper Creek are part of the Watershed Function Scientific Focus Area (WFSFA) located in the Upper Colorado River Basin, United States. The hydrologic model uses the U.S. Geological Survey coupled groundwater and surface water flow model (GSFLOW). Input and output files are askii format, while the model executable (gsflow.exe), source code, example problems and documentation describing model files is provided at the following U.S. Geological Survey website. https://www.usgs.gov/software/coupled-ground-water-and-surface-water-flow-model-gsflow. GSFLOW executables are compiled for either Microsoft Windows or Linux operating systems.
Estimating marginal likelihood is of central importance to Bayesian model selection and/or model averaging. The nested sampling method has been recently used together with the Metropolis-Hasting (M-H) sampling algorithm for estimating marginal likelihood. This study develops a new implementation of nested sampling by using the DiffeRential Evolution Adaptive Metropolis (DREAMzs) sampling algorithm. The two implementations of nested sampling are evaluated for four models of a synthetic groundwater flow modeling. The DREAMzs-based nested sampling outperforms the M-H-based nested sampling in terms of their accuracy, convergence, efficiency, and stability, which is attributed to the fact that DREAMzs is more robust than M-H for parameter sampling. The nested sampling method is also compared with four other methods (arithmetic mean, harmonic mean, stabilized harmonic mean, and thermodynamic integration) commonly used for estimating marginal likelihood and posterior probability of the four groundwater models. The comparative study requires hundreds of millions of model executions, which would not be possible without using surrogate models to replace the original models. Using the arithmetic mean estimator as the reference, the comparison reveals that thermodynamic integration outperforms nested sampling in terms of accuracy and stability, whereas nested sampling is more computationally efficient to reach to convergence. Here, the harmonic mean and stabilized harmonic mean methods give the worst marginal likelihood estimation. Accurate marginal likelihood estimation is important for accurate estimation of posterior model probability and better predictive performance of Bayesian model averaging.
Methods, media, and systems for detecting attack are provided. In some embodiments, the methods include: comparing at least part of a document to a static detection model; determining whether attacking code is included in the document based on the comparison of the document to the static detection model; executing at least part of the document; determining whether attacking code is included in the document based on the execution of the at least part of the document; and if attacking code is determined to be included in the document based on at least one of the comparison of the document to the static detection model and the execution of the at least part of the document, reporting the presence of an attack. In some embodiments, the methods include: selecting a data segment in at least one portion of an electronic document; determining whether the arbitrarily selected data segment can be altered without causing the electronic document to result in an error when processed by a corresponding program; in response to determining that the arbitrarily selected data segment can be altered, arbitrarily altering the data segment in the at least one portion of the electronic document to produce an altered electronic document; and determining whether the corresponding program produces an error state when the altered electronic document is processed by the corresponding program.
Methods, media, and systems for detecting attack are provided. In some embodiments, the methods include: comparing at least part of a document to a static detection model; determining whether attacking code is included in the document based on the comparison of the document to the static detection model; executing at least part of the document; determining whether attacking code is included in the document based on the execution of the at least part of the document; and if attacking code is determined to be included in the document based on at least one of the comparison of the document to the static detection model and the execution of the at least part of the document, reporting the presence of an attack. In some embodiments, the methods include: selecting a data segment in at least one portion of an electronic document; determining whether the arbitrarily selected data segment can be altered without causing the electronic document to result in an error when processed by a corresponding program; in response to determining that the arbitrarily selected data segment can be altered, arbitrarily altering the data segment in the at least one portion of the electronic document to produce an altered electronic document; and determining whether the corresponding program produces an error state when the altered electronic document is processed by the corresponding program.
Methods, media, and systems for detecting attack are provided. In some embodiments, the methods include: comparing at least part of a document to a static detection model; determining whether attacking code is included in the document based on the comparison of the document to the static detection model; executing at least part of the document; determining whether attacking code is included in the document based on the execution of the at least part of the document; and if attacking code is determined to be included in the document based on at least one of the comparison of the document to the static detection model and the execution of the at least part of the document, reporting the presence of an attack. In some embodiments, the methods include: selecting a data segment in at least one portion of an electronic document; determining whether the arbitrarily selected data segment can be altered without causing the electronic document to result in an error when processed by a corresponding program; in response to determining that the arbitrarily selected data segment can be altered, arbitrarily altering the data segment in the at least one portion of the electronic document to produce an altered electronic document; and determining whether the corresponding program produces an error state when the altered electronic document is processed by the corresponding program.
Abstract Impedance matching is a novel approach to executing model‐in‐the‐loop (MIL) simulations. The concept, key features, and sample applications of this approach have been described in a series of publications. This paper advances theory and implementation for impedance‐matching MIL by: (1) developing a feedback linearization technique for implementing MIL for nonlinear virtual systems, (2) systematically characterizing MIL performance‐stability tradeoffs using three design‐oriented criteria—performance: defined as closeness of the controlled‐actuator impedance to the virtual‐boundary impedance;control effort: low controller response at high frequencies to reduce sensitivity to measurement noise and uncertainties in the actuator model; andstability: pursued using passivity of the controlled actuator system, and (3) assessing, through experimentation, the robustness of two ways to estimate feedback reaction force from the test article. These fundamental advancements to MIL are described using a one‐dimensional configuration consisting of a fluid‐filled cylindrical vessel as the physical test article and a uniaxial hydraulic shake table controlled to imitate different seismic isolation systems at the base of the vessel.
The Scheme Machine is one of several design projects of the Digital Design Derivation group at Indiana University. It differs from the other projects in its focus on issues of system design and its connection to surrounding research in programming language semantics, compiler construction, and programming methodology underway at Indiana and elsewhere. The genesis of the project dates to the early 1980's, when digital design derivation research branched from the surrounding research effort in programming languages. Both branches have continued to develop in parallel, with this particular project serving as a bridge. However, by 1990 there remained little real interaction between the branches and recently we have undertaken to reintegrate them. On the software side, researchers have refined a mathematically rigorous (but not mechanized) treatment starting with the fully abstract semantic definition of Scheme and resulting in an efficient implementation consisting of a compiler and virtual machine model, the latter typically realized with a general purpose microprocessor. The derivation includes a number of sophisticated factorizations and representations and is also deep example of the underlying engineering methodology. The hardware research has created a mechanized algebra supporting the tedious and massive transformations often seen at lower levels of design. This work has progressed to the point that large scale devices, such as processors, can be derived from first-order finite state machine specifications. This is roughly where the language oriented research stops; thus, together, the two efforts establish a thread from the highest levels of abstract specification to detailed digital implementation. The Scheme Machine project challenges hardware derivation research in several ways, although the individual components of the system are of a similar scale to those we have worked with before. The machine has a custom dual-ported memory to support garbage collection. It consists of four tightly coupled processes--processor, collector, allocator, memory--with a very non-trivial synchronization relationship. Finally, there are deep issues of representation for the run-time objects of a symbolic processing language. The research centers on verification through integrated formal reasoning systems, but is also involved with modeling and prototyping environments. Since the derivation algebra is basd on an executable modeling language, there is opportunity to incorporate design animation in the design process. We are looking for ways to move smoothly and incrementally from executable specifications into hardware realization. For example, we can run the garbage collector specification, a Scheme program, directly against the physical memory prototype, and similarly, the instruction processor model against the heap implementation.
Planning in an unknown environment presents a number of challenges: incorrect world models, unpredictable variation in execution, and fixed depletable resources. Productivity in the face of these challenges requires an integrated approach to planning and execution that is capable of accomplishing goals, reacting to variation, and maximizing overall utility. We examine this problem in the context of a Europa Lander concept mission. We model the problem as a hierarchical task network, framing it as a utility maximization problem with a depletable energy resource. Then, we propose a planning and execution framework that responds to feedback using three techniques: flexible execution, periodic replanning, and online parameter estimation and re-goaling. We demonstrate the efficacy of each of these techniques through simulation of a Europa Lander mission, showing higher utility achievement compared to simpler approaches, when presented with variation in energy consumption. We demonstrate that an approach to scheduling and execution that is grounded in decision theory and integrated planning and execution will be an enabling technology for future tightly-constrained planetary surface missions.
A method for predicting failure parameters of semiconductor devices can include receiving a set of data that includes (i) characteristics of a sample semiconductor device, and (ii) parameters characterizing a stress condition. The method further includes extracting a plurality of feature values from the set of data and inputting the plurality of feature values into a trained model executing on the one or more processors, wherein the trained model is configured according to an artificial intelligence (AI) algorithm based on a previous plurality of feature values, and wherein the trained model is operable to output a failure prediction based on the plurality of feature values. Further, the method includes generating, via the trained model, a predicted failure parameter of the sample semiconductor device due to the stress condition.