Search NASA⌕ Search

SEARCH · Search NASA

Results for “Logic Programming”

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

Global trajectory targeting via computer graphics

A technique is described in which the two-point boundary value problem (TPBVP) may be solved with the aid of interactive computer graphics. The particular TPBVP considered is the optimal electric propulsion space trajectory problem. An appropriate two-dimensional projection of the TPBVP mapping, or trajectory, is displayed on the computer's television screen, and a man-in-the-loop varies selected trajectory starting conditions in the fashion of a nonlinear walk until the viewed trajectory endpoint lies near a displayed target. Once global targeting is accomplished in this manner, program internal logic can easily handle local targeting to strongly solve the TPBVP.

Mann, F. I.↗

Modifications to the streamtube curvature program. Volume 1: Program modifications and user's manual

The improvements which have been incorporated in the Streamtube Curvature Program to enhance both its computational and diagnostic capabilities are described. Detailed descriptions are given of the revisions incorporated to more reliably handle the jet stream-external flow interaction at trailing edges. Also presented are the augmented boundary layer procedures and a variety of other program changes relating to program diagnostics and extended solution capabilities. An updated User's Manual, that includes information on the computer program operation, usage, and logical structure, is presented. User documentation includes an outline of the general logical flow of the program and detailed instructions for program usage and operation. From the standpoint of the programmer, the overlay structure is described. The input data, output formats, and diagnostic printouts are covered in detail and illustrated with three typical test cases.

Ferguson, D. R.↗

Rule-based air combat simulation

An improved version of the Adaptive Maneuvering Logic (AML) program for air-combat maneuvering is discussed. The modifications and improvements incorporated into the AML program are documented.

Burgin, G. H.↗

Nuclear Engine System Simulation (NESS) version 2.0

The topics are presented in viewgraph form and include the following; nuclear thermal propulsion (NTP) engine system analysis program development; nuclear thermal propulsion engine analysis capability requirements; team resources used to support NESS development; expanded liquid engine simulations (ELES) computer model; ELES verification examples; NESS program development evolution; past NTP ELES analysis code modifications and verifications; general NTP engine system features modeled by NESS; representative NTP expander, gas generator, and bleed engine system cycles modeled by NESS; NESS program overview; NESS program flow logic; enabler (NERVA type) nuclear thermal rocket engine; prismatic fuel elements and supports; reactor fuel and support element parameters; reactor parameters as a function of thrust level; internal shield sizing; and reactor thermal model.

Pelaccio, Dennis G.↗

Advanced turbulence models for turbomachinery

Development and assessment of the single-time-scale k-epsilon turbulence model with different near-wall treatments and the multi-scale turbulence model for rotating flows are presented. These turbulence models are coded as self contained module decks that can be interfaced with a number of CFD main flow solvers. For each model, a stand-alone module deck with its own formulation, discretization scheme, solver and boundary condition implementations is presented. These satellite decks will take as input (from a main flow solver) the velocity field, grid, boundary condition specifications and will deliver turbulent quantities as output. These modules were tested as separate entities and, although many logical and programming problems were overcome, only wider use and further testing can render the modules sufficiently 'fool proof'.

Hadid, Ali H.↗

Automatic Abstraction in Planning

Traditionally, abstraction in planning has been accomplished by either state abstraction or operator abstraction, neither of which has been fully automatic. We present a new method, predicate relaxation, for automatically performing state abstraction. PABLO, a nonlinear hierarchical planner, implements predicate relaxation. Theoretical, as well as empirical results are presented which demonstrate the potential advantages of using predicate relaxation in planning. We also present a new definition of hierarchical operators that allows us to guarantee a limited form of completeness. This new definition is shown to be, in some ways, more flexible than previous definitions of hierarchical operators. Finally, a Classical Truth Criterion is presented that is proven to be sound and complete for a planning formalism that is general enough to include most classical planning formalisms that are based on the STRIPS assumption.

LOGIC PROGRAMMING↗

A Physics Exploratory Experiment on Plasma Liner Formation

Momentum flux for imploding a target plasma in magnetized target fusion (MTF) may be delivered by an array of plasma guns launching plasma jets that would merge to form an imploding plasma shell (liner). In this paper, we examine what would be a worthwhile experiment to do in order to explore the dynamics of merging plasma jets to form a plasma liner as a first step in establishing an experimental database for plasma-jets driven magnetized target fusion (PJETS-MTF). Using past experience in fusion energy research as a model, we envisage a four-phase program to advance the art of PJETS-MTF to fusion breakeven Q is approximately 1). The experiment (PLX (Plasma Liner Physics Exploratory Experiment)) described in this paper serves as Phase I of this four-phase program. The logic underlying the selection of the experimental parameters is presented. The experiment consists of using twelve plasma guns arranged in a circle, launching plasma jets towards the center of a vacuum chamber. The velocity of the plasma jets chosen is 200 km/s, and each jet is to carry a mass of 0.2 mg - 0.4 mg. A candidate plasma accelerator for launching these jets consists of a coaxial plasma gun of the Marshall type.

Thio, Y. C. Francis↗

Challenges and Demands on Automated Software Revision

In the past three decades, automated program verification has undoubtedly been one of the most successful contributions of formal methods to software development. However, when verification of a program against a logical specification discovers bugs in the program, manual manipulation of the program is needed in order to repair it. Thus, in the face of existence of numerous unverified and un- certified legacy software in virtually any organization, tools that enable engineers to automatically verify and subsequently fix existing programs are highly desirable. In addition, since requirements of software systems often evolve during the software life cycle, the issue of incomplete specification has become a customary fact in many design and development teams. Thus, automated techniques that revise existing programs according to new specifications are of great assistance to designers, developers, and maintenance engineers. As a result, incorporating program synthesis techniques where an algorithm generates a program, that is correct-by-construction, seems to be a necessity. The notion of manual program repair described above turns out to be even more complex when programs are integrated with large collections of sensors and actuators in hostile physical environments in the so-called cyber-physical systems. When such systems are safety/mission- critical (e.g., in avionics systems), it is essential that the system reacts to physical events such as faults, delays, signals, attacks, etc, so that the system specification is not violated. In fact, since it is impossible to anticipate all possible such physical events at design time, it is highly desirable to have automated techniques that revise programs with respect to newly identified physical events according to the system specification.

Bonakdarpour, Borzoo↗

An Automaton Rover Enabling Long Duration In-Situ Science in Extreme Environments

The Automaton Rover for Extreme Environments (AREE) is a NASA Innovative Advanced Concept (NIAC) funded study focused on enabling long duration science on Venus by replacing vulnerable electronics with an entirely mechanical design. By utilizing high temperature alloys, the rover would survive on the surface of Venus for weeks if not months. The rover concept harvests wind energy using a turbine and stores it in a constant force spring. The mobility system would be guided by a mechanical computer and logic system, programed to carry out the mission. It would collect basic science data such as wind speed, temperature, and seismic events. Communicating the data back to Earth is the most challenging aspect of the system design with multiple options being explored in a trade: a simple electronic high temperature transponder, a retroreflector target or inscribing phonograph style records to be launched via a balloon to a high altitude drone capable of transmitting the data back to Earth. AREE is not only a new exciting in-situ rover concept, but also a paradigm shift to conducting in-situ science in extreme environments. Traditional extreme environment vehicles collect as many diverse data points as possible in the short period of time before system failure. AREE breaks that trend by exploring what can be done with only a few basic scientific measurements, but recorded over long periods of time. In addition to Venus, the concept can be useful in other extreme environments in the solar system including Mercury, Jupiter's radiation belts, the interiors of gas giants, the mantle of the Earth and volcanoes throughout the solar system.

Parness, Aaron↗

IOTA Pre-Bake Test Development

The IOTA (Integrable Optics Test Accelerator) Bakeout project is intended to improve the quality of the vacuum within the IOTA ring. Impurities consisting of hydrogen and oxygen that build within the beampipe are reduced through applying heat to the beampipe’s exterior. Two versions of the Bakeout project exist, one as a smaller scale test setup, and one five times larger located within the IOTA ring. During my internship, I worked together with a team to bring this project from an effectively dormant state to ready for testing, working together to create full documentation of the PLC (Programmable Logic Controller) programs, making multiple new hardware configurations of this test possible, as well as an additional safety system.

Seagrave, Kayla [DuPage Coll.; Fermilab]↗

Verifying PLC Programs via Monitors: Extending the Integration of FRET and PLCverif

Verification of Programmable Logic Controller (PLC) programs requires reasoning about propositions qualified in terms of time. CERN’s PLCverif, an open-source tool for the analysis of safety-critical PLC systems, uses Linear Temporal Logic (LTL) for the specification of properties. Until now, PLCverif depended on third-party tools that accept LTL specifications to perform verification. However, our experience with industrial PLC programs shows that, to overcome analysis limitations, a wide range of techniques are needed to successfully verify complex properties. In this paper, we extend PLCverif to enable PLC program verification of pure-past LTL (PLTL) safety properties with assertion-based verification tools. To this end, we take an algorithm from the runtime-monitoring domain, apply it to bounded model checking of PLC programs, and implement it in PLCverif. We extend the integration of NASA’s Formal Requirements Elicitation Tool (FRET) into PLCverif to use PLTL properties generated with FRET. In addition, we leverage the program structure induced by the PLC scan-cycle for a state-space reduction. Finally, we expose the algorithm to a real-world case study of critical systems at CERN.

Formal verification↗

Definition study of a Variable Cycle Experimental Engine (VCEE) and associated test program and test plan

The Definition Study of a Variable Cycle Experimental Engine (VCEE) and Associated Test Program and Test Plan, was initiated to identify the most cost effective program for a follow-on to the AST Test Bed Program. The VCEE Study defined various subscale VCE's based on different available core engine components, and a full scale VCEE utilizing current technology. The cycles were selected, preliminary design accomplished and program plans and engineering costs developed for several program options. In addition to the VCEE program plans and options, a limited effort was applied to identifying programs that could logically be accomplished on the AST Test Bed Program VCE to extend the usefulness of this test hardware. Component programs were provided that could be accomplished prior to the start of a VCEE program.

Allan, R. D.↗

ON THE EFFECTIVENESS OF LLMS IN UNIT TEST GENERATION FOR STRUCTURED TEXT PROGRAMS

The reliability of industrial automation systems heavily depends on the correctness of Programmable Logic Controller (PLC) programs, which are often written in Structured Text (ST). While Large Language Models (LLMs) have shown promise in automating test generation for mainstream programming languages, their effectiveness for the syntactically strict ST language remains underexplored. This thesis presents a systematic empirical evaluation of three state-of-the-art LLMs—GPT-4o, Gemini 2.5 Pro, and Claude Sonnet 4.5—for generating ST unit tests. We examine three prompting strategies: Natural Language (NL), Code Language (CL), and Chain-of-Thought (CoT), across a curated set of 11 ST function blocks. The quality of the generated tests is assessed using Compilation Success Rate (CSR), Statement Coverage (SC), and Branch Coverage (BC). In the zero-shot setting, Claude Sonnet 4.5 achieves the highest CSR, while Gemini 2.5 Pro consistently delivers the best statement and branch coverage, particularly under CL prompts. By incorporating a one-shot CL prompt, all models exhibit substantial improvements—most notably GPT-4o, whose CSR increases from 45.45% to 90.91%, with substantial gains in both SC and BC. To further contextualize these findings, we compare GPT-4o’s one-shot results with PLCAutoTester, a state-ofthe- art ST unit test generation tool, on an additional benchmark dataset. While LLMgenerated tests approach competitive coverage levels, PLCAutoTester maintains significantly higher and more stable coverage across programs. This study provides the first comprehensive benchmark of modern LLMs for ST unit testing, highlighting their strengths, limitations, and improvements through one-shot prompting, and positioning their performance relative to specialized automated testing tools in industrial automation.

42 ENGINEERING↗

Generalized Symbolic Execution for Model Checking and Testing

Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based approaches: one, we define a program instrumentation, which enables standard model checkers to perform symbolic execution; two, we give a novel symbolic execution algorithm that handles dynamically allocated structures (e.g., lists and trees), method preconditions (e.g., acyclicity of lists), data (e.g., integers and strings) and concurrency. The program instrumentation enables a model checker to automatically explore program heap configurations (using a systematic treatment of aliasing) and manipulate logical formulae on program data values (using a decision procedure). We illustrate two applications of our framework: checking correctness of multi-threaded programs that take inputs from unbounded domains with complex structure and generation of non-isomorphic test inputs that satisfy a testing criterion. Our implementation for Java uses the Java PathFinder model checker.

Khurshid, Sarfraz↗

Standard Transistor Arrays

Standard Transistor Array (STAR) design system is semicustom approach to generating random-logic integrated MOS digital circuits. Primary program in STAR system is CAPSTAR, STAR Cell Arrangement Program. CAPSTAR is augmented by automatic routining program, Display program and library of logic cells.

Cox, G. W.↗

Modifications to an interactive model of the human body during exercise: With special emphasis on thermoregulation

Since 1988 an interactive computer model of the human body during exercise has been under development by a number of undergraduate students in the Department of Chemical Engineering at Iowa State University. The program, written under the direction of Dr. Richard C. Seagrave, uses physical characteristics of the user, environmental conditions and activity information to predict the onset of hypothermia, hyperthermia, dehydration, or exhaustion for various levels and durations of a specified exercise. The program however, was severely limited in predicting the onset of dehydration due to the lack of sophistication with which the program predicts sweat rate and its relationship to sensible water loss, degree of acclimatization, and level of physical training. Additionally, it was not known whether sweat rate also depended on age and gender. For these reasons, the goal of this creative component was to modify the program in the above mentioned areas by applying known information and empirical relationships from literature. Furthermore, a secondary goal was to improve the consistency with which the program was written by modifying user input statements and improving the efficiency and logic of the program calculations.

Scherb, Megan Kay↗