Search NASA⌕ Search

SEARCH · Search NASA

Results for “automata”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Methodology for Examining the Operator and the System Concurrently: Pilot Interaction with Automation

Complex system description is problematic when considering operator task activities interacting with system dynamics. Engineering languages have matured sufficiently to allow machine system description at various levels of depth and breadth but without operator synergy. Concurrently, Task Analysis methods have evolved along diverse lines enabling a description of the operator in the system from various paradigms but not describing the system. A void exists when attempting to view the system and the operator in the same plane. We propose a methodology employing descriptive languages from different domains viewed in a single dimension. Finite Automata (FA) languages describe the machine system in the proposed approach. Operator task specifications, a form of task analysis output, examine the operator activities within the system. Operator task specifications were then selected for discrete task activities and overlaid on the system description to examine operator inputs and subsequently view system responses. Unexpected (surprise) and undesirable system behavior was expected to emerge from this analysis. In this paper we shall first describe the methodology and show how the two perspectives, machine model and operator task specifications are integrated. Following we describe the process of doing such analysis using an example from cockpit automation. The methodology was employed in the analysis of a new function that was added to an existing automatic flight control system. We begin by defining a flight scenario involving all aspects of pilot interaction with the new function. Then, we proceed to develop a basic model of the machine behavior, in the context of pilot actions. Finally we superimpose the operator task specification on the machine model and perform the analysis. The proposed methodology may have broad appeal to system designers and human factors specialists. A common language for engineers of diverse domains is a strong point of this approach. Systems engineers may not fully understand operational considerations and human limitations, and human factors specialists may not be exposed to the full extent of system behavior. We hope the proposed methodology is adopted by both disciplines and in the process each assimilates a common language to address potential shortcomings of either approach separately.

Austin, David↗
NASA NTRS2002

An Overview of the Runtime Verification Tool Java PathExplorer

We present an overview of the Java PathExplorer runtime verification tool, in short referred to as JPAX. JPAX can monitor the execution of a Java program and check that it conforms with a set of user provided properties formulated in temporal logic. JPAX can in addition analyze the program for concurrency errors such as deadlocks and data races. The concurrency analysis requires no user provided specification. The tool facilitates automated instrumentation of a program's bytecode, which when executed will emit an event stream, the execution trace, to an observer. The observer dispatches the incoming event stream to a set of observer processes, each performing a specialized analysis, such as the temporal logic verification, the deadlock analysis and the data race analysis. Temporal logic specifications can be formulated by the user in the Maude rewriting logic, where Maude is a high-speed rewriting system for equational logic, but here extended with executable temporal logic. The Maude rewriting engine is then activated as an event driven monitoring process. Alternatively, temporal specifications can be translated into efficient automata, which check the event stream. JPAX can be used during program testing to gain increased information about program executions, and can potentially furthermore be applied during operation to survey safety critical systems.

Havelund, Klaus↗
NASA NTRS2004

Product-oriented Software Certification Process for Software Synthesis

The purpose of this document is to propose a product-oriented software certification process to facilitate use of software synthesis and formal methods. Why is such a process needed? Currently, software is tested until deemed bug-free rather than proving that certain software properties exist. This approach has worked well in most cases, but unfortunately, deaths still occur due to software failure. Using formal methods (techniques from logic and discrete mathematics like set theory, automata theory and formal logic as opposed to continuous mathematics like calculus) and software synthesis, it is possible to reduce this risk by proving certain software properties. Additionally, software synthesis makes it possible to automate some phases of the traditional software development life cycle resulting in a more streamlined and accurate development process.

Nelson, Stacy↗
NASA NTRS1997

Correspondence between discrete and continuous models of excitable media: trigger waves

We present a theoretical framework for relating continuous partial differential equation (PDE) models of excitable media to discrete cellular automata (CA) models on a randomized lattice. These relations establish a quantitative link between the CA model and the specific physical system under study. We derive expressions for the CA model's plane wave speed, critical curvature, and effective diffusion constant in terms of the model's internal parameters (the interaction radius, excitation threshold, and time step). We then equate these expressions to the corresponding quantities obtained from solution of the PDEs (for a fixed excitability). This yields a set of coupled equations with a unique solution for the required CA parameter values. Here we restrict our analysis to "trigger" wave solutions obtained in the limiting case of a two-dimensional excitable medium with no recovery processes. We tested the correspondence between our CA model and two PDE models (the FitzHugh-Nagumo medium and a medium with a "sawtooth" nonlinear reaction source) and found good agreement with the numerical solutions of the PDEs. Our results suggest that the behavior of trigger waves is actually controlled by a small number of parameters.

Non-NASA Center↗
NASA NTRS2004

Minnowbrook IV: 2003 Workshop on Transition and Unsteady Aspects of Turbomachinery Flows

This Minnowbrook IV 2003 workshop on Transition and Unsteady Aspects of Turbomachinery Flows includes the following topics: 1) Current Issues in Unsteady Turbomachinery Flows; 2) Global Instability and Control of Low-Pressure Turbine Flows; 3) Influence of End Wall Leakage on Secondary Flow Development in Axial Turbines; 4) Active and Passive Flow Control on Low Pressure Turbine Airfoils; 5) Experimental and Numerical Investigation of Transitional Flows as Affected by Passing Wakes; 6) Effects of Freestream Turbulence on Turbine Blade Heat Transfer; 7) Bypass Transition Via Continuous Modes and Unsteady Effects on Film Cooling; 8) High Frequency Surface Heat Flux Imaging of Bypass Transition; 9) Skin Friction and Heat Flux Oscillations in Upstream Moving Wave Packets; 10) Transition Mechanisms and Use of Surface Roughness to Enhance the Benefits of Wake Passing in LP Turbines; 11) Transient Growth Approach to Roughness-Induced Transition; 12) Roughness- and Freestream-Turbulence-Induced Transient Growth as a Bypass Transition Mechanism; 13) Receptivity Calculations as a Means to Predicting Transition; 14) On Streamwise Vortices in a Curved Wall Jet and Their Effect on the Mean Flow; 15) Plasma Actuators for Separation Control of Low Pressure Turbine Blades; 16) Boundary-Layer Separation Control Under Low-Pressure-Turbine Conditions Using Glow-Discharge Plasma Actuators; 17) Control of Separation for Low Pressure Turbine Blades: Numerical Simulation; 18) Effects of Elevated Free-Stream Turbulence on Active Control of a Separation Bubble; 19) Wakes, Calming and Transition Under Strong Adverse Pressure Gradients; 20) Transitional Bubble in Periodic Flow Phase Shift; 21) Modelling Spots: The Calmed Region, Pressure Gradient Effects and Background; 22) Modeling of Unsteady Transitional Flow on Axial Compressor Blades; 23) Challenges in Predicting Component Efficiencies in Turbomachines With Low Reynolds Number Blading; 24) Observations on the Causal Relationship Between Blade Count and Developing Rotating Stall in a Four Stage Axial Compressor; 25) Experimental and Numerical Study of Non-Linear Interactions in Transonic Nozzle Flow; 26) Clocking Effects on a Modern Stage and One-Half Transonic Turbine; 27) DNS and LES of Transition on Turbine Blades; 28) The Use of Cellular Automata in Modeling the Transition; 29) Predicting Unsteady Buffet Onset Using RANS Solutions; 30) Transition Modelling With the SST Turbulence Model and an Intermittency Transport; and 31) Equation Workshop Summary Transcript

LaGraff, John E.↗
NASA NTRS2005

Real-Time System Verification by Kappa-Induction

We report the first formal verification of a reintegration protocol for a safety-critical, fault-tolerant, real-time distributed embedded system. A reintegration protocol increases system survivability by allowing a node that has suffered a fault to regain state consistent with the operational nodes. The protocol is verified in the Symbolic Analysis Laboratory (SAL), where bounded model checking and decision procedures are used to verify infinite-state systems by k-induction. The protocol and its environment are modeled as synchronizing timeout automata. Because k-induction is exponential with respect to k, we optimize the formal model to reduce the size of k. Also, the reintegrator's event-triggered behavior is conservatively modeled as time-triggered behavior to further reduce the size of k and to make it invariant to the number of nodes modeled. A corollary is that a clique avoidance property is satisfied.

Pike, Lee S.↗
NASA NTRS2004

Abstraction and Assume-Guarantee Reasoning for Automated Software Verification

Compositional verification and abstraction are the key techniques to address the state explosion problem associated with model checking of concurrent software. A promising compositional approach is to prove properties of a system by checking properties of its components in an assume-guarantee style. This article proposes a framework for performing abstraction and assume-guarantee reasoning of concurrent C code in an incremental and fully automated fashion. The framework uses predicate abstraction to extract and refine finite state models of software and it uses an automata learning algorithm to incrementally construct assumptions for the compositional verification of the abstract models. The framework can be instantiated with different assume-guarantee rules. We have implemented our approach in the COMFORT reasoning framework and we show how COMFORT out-performs several previous software model checking approaches when checking safety properties of non-trivial concurrent programs.

Chaki, S.↗
NASA NTRS2005

Spatial Predictive Modeling and Remote Sensing of Land Use Change in the Chesapeake Bay Watershed

This project was focused on modeling the processes by which increasing demand for developed land uses, brought about by changes in the regional economy and the socio-demographics of the region, are translated into a changing spatial pattern of land use. Our study focused on a portion of the Chesapeake Bay Watershed where the spatial patterns of sprawl represent a set of conditions generally prevalent in much of the U.S. Working in the region permitted us access to (i) a time-series of multi-scale and multi-temporal (including historical) satellite imagery and (ii) an established network of collaborating partners and agencies willing to share resources and to utilize developed techniques and model results. In addition, a unique parcel-level tax assessment database and linked parcel boundary maps exists for two counties in the Maryland portion of this region that made it possible to establish a historical cross-section time-series database of parcel level development decisions. Scenario analyses of future land use dynamics provided critical quantitative insight into the impact of alternative land management and policy decisions. These also have been specifically aimed at addressing growth control policies aimed at curbing exurban (sprawl) development. Our initial technical approach included three components: (i) spatial econometric modeling of the development decision, (ii) remote sensing of suburban change and residential land use density, including comparisons of past change from Landsat analyses and more traditional sources, and (iii) linkages between the two through variable initialization and supplementation of parcel level data. To these we added a fourth component, (iv) cellular automata modeling of urbanization, which proved to be a valuable addition to the project. This project has generated both remote sensing and spatially explicit socio-economic data to estimate and calibrate the parameters for two different types of land use change models and has undertaken analyses of these models. One (the CA model) is driven largely by observations on past patterns of land use change, while the other (the EC model) is driven by mechanisms of the land use change decision at the parcel level. Our project may be the first serious attempt at developing both types of models for the same area, using as much common data as possible. We have identified the strengths and weaknesses of the two approaches and plan to continue to revise each model in the light of new data and new lessons learned through continued collaboration. Questions, approaches, findings, publication and presentation lists concerning the research are also presented.

Goetz, Scott J.↗
NASA NTRS2005

Enhancements of Tow-Steering Design Techniques: Design of Rectangular Panel Under Combined Loads

An extension to existing design tools that utilize tow-steering is presented which is used to investigate the use of elastic tailoring for a flat panel with a central hole under combined loads of compression and shear. The elastic tailoring is characterized by tow-steering within individual lamina as well as a novel approach based on selective reinforcement, which attempts to minimize compliance through the use of Cellular Automata design concepts. The selective reinforcement designs lack any consideration of manufacturing constraints, so a new tow-steered path definition was developed to translate the prototype selective reinforcement designs into manufacturable plies. The minimum weight design of a flat panel under combined loading was based on a model provided by NASA-Langley personnel and analyzed by STAGS within the OLGA design environment. Baseline designs using traditional straight fiber plies were generated, as well as tow-steered designs which incorporated parallel, tow-drop, and overlap plies within the laminate. These results indicated that the overlap method provided the best improvement with regards to weight and performance as compared to traditional constant stiffness monocoque panels, though the laminates did not measure up to similar designs from the literature using sandwich and isogrid constructions. Further design studies were conducted using various numbers of the selective reinforcement plies at the core and outer surface of the laminate. None of these configurations exhibited notable advantages with regard to weight or buckling performance. This was due to the fact that the minimization of the compliance tended to direct the major stresses toward the center of the panel, which decreased the ability of the structure to withstand loads leading to instability.

Tatting, Brian F.↗
NASA NTRS2006

Completing and Adapting Models of Biological Processes

We present a learning-based method for model completion and adaptation, which is based on the combination of two approaches: 1) R2D2C, a technique for mechanically transforming system requirements via provably equivalent models to running code, and 2) automata learning-based model extrapolation. The intended impact of this new combination is to make model completion and adaptation accessible to experts of the field, like biologists or engineers. The principle is briefly illustrated by generating models of biological procedures concerning gene activities in the production of proteins, although the main application is going to concern autonomic systems for space exploration.

Margaria, Tiziana↗
NASA NTRS2007

Human Activity Behavior and Gesture Generation in Virtual Worlds for Long- Duration Space Missions

A virtual worlds presentation technique with embodied, intelligent agents is being developed as an instructional medium suitable to present in situ training on long term space flight. The system combines a behavioral element based on finite state automata, a behavior based reactive architecture also described as subsumption architecture, and a belief-desire-intention agent structure. These three features are being integrated to describe a Brahms virtual environment model of extravehicular crew activity which could become a basis for procedure training during extended space flight.

Sierhuis, Maarten↗
NASA NTRS2008

Proceedings of the Sixth NASA Langley Formal Methods (LFM) Workshop

Today's verification techniques are hard-pressed to scale with the ever-increasing complexity of safety critical systems. Within the field of aeronautics alone, we find the need for verification of algorithms for separation assurance, air traffic control, auto-pilot, Unmanned Aerial Vehicles (UAVs), adaptive avionics, automated decision authority, and much more. Recent advances in formal methods have made verifying more of these problems realistic. Thus we need to continually re-assess what we can solve now and identify the next barriers to overcome. Only through an exchange of ideas between theoreticians and practitioners from academia to industry can we extend formal methods for the verification of ever more challenging problem domains. This volume contains the extended abstracts of the talks presented at LFM 2008: The Sixth NASA Langley Formal Methods Workshop held on April 30 - May 2, 2008 in Newport News, Virginia, USA. The topics of interest that were listed in the call for abstracts were: advances in formal verification techniques; formal models of distributed computing; planning and scheduling; automated air traffic management; fault tolerance; hybrid systems/hybrid automata; embedded systems; safety critical applications; safety cases; accident/safety analysis.

Rozier, Kristin Yvonne↗
NASA NTRS2008

Verification and Planning Based on Coinductive Logic Programming

Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution as well as preliminary implementations of the planning and verification applications have been developed [4]. Co-LP and Model Checking: The vast majority of properties that are to be verified can be classified into safety properties and liveness properties. It is well known within model checking that safety properties can be verified by reachability analysis, i.e, if a counter-example to the property exists, it can be finitely determined by enumerating all the reachable states of the Kripke structure.

Bansal, Ajay↗
NASA NTRS2008

Automated Assume-Guarantee Reasoning by Abstraction Refinement

Current automated approaches for compositional model checking in the assume-guarantee style are based on learning of assumptions as deterministic automata. We propose an alternative approach based on abstraction refinement. Our new method computes the assumptions for the assume-guarantee rules as conservative and not necessarily deterministic abstractions of some of the components, and refines those abstractions using counter-examples obtained from model checking them together with the other components. Our approach also exploits the alphabets of the interfaces between components and performs iterative refinement of those alphabets as well as of the abstractions. We show experimentally that our preliminary implementation of the proposed alternative achieves similar or better performance than a previous learning-based implementation.

Pasareanu, Corina S.↗
NASA NTRS2009

Formal methods for modeling and analysis of hybrid systems

A technique based on the use of a quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata is taught. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. The technique works on linear and non-linear polynomial hybrid systems: the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. An exemplar tool in the SAL environment built over the theorem prover PVS is detailed. The technique scales well to large and complex hybrid systems.

Tiwari, Ashish↗
NASA NTRS2011

A Multi-Encoding Approach for LTL Symbolic Satisfiability Checking

Formal behavioral specifications written early in the system-design process and communicated across all design phases have been shown to increase the efficiency, consistency, and quality of the system under development. To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal logic (LTL). We introduce a novel encoding of symbolic transition-based Buchi automata and a novel, "sloppy," transition encoding, both of which result in improved scalability. We also define novel BDD variable orders based on tree decomposition of formula parse trees. We describe and extensively test a new multi-encoding approach utilizing these novel encoding techniques to create 30 encoding variations. We show that our novel encodings translate to significant, sometimes exponential, improvement over the current standard encoding for symbolic LTL satisfiability checking.

Rozier, Kristin Y.↗