Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICAL LOGIC”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

A Safety Conundrum Illustrated: Logic, Mathematics, and Science Are Not Enough

In an ideal world, conversations about whether a particular system is safe, or whether a particular method or tool enhances safety, would be emotion-free discussions concentrating on the level of safety required, available evidence, and coherent logical, mathematical, or scientific arguments based on that evidence. In the real world, discussions about safety are often not emotion-free. Political and economic arguments may play a bigger role than logical, mathematical, and scientific arguments, and psychological factors may be as important, or even more important, than purely technical factors. This paper illustrates the conundrum that can result from this clash of the ideal and the real by means of an imagined conversation among a collection of fictional characters representing various types of people who may be participating in a safety discussion.

Holloway, C. M.↗
NASA NTRS1986

The Science of Computing: Expert Systems

The creative urge of human beings is coupled with tremendous reverence for logic. The idea that the ability to reason logically--to be rational--is closely tied to intelligence was clear in the writings of Plato. The search for greater understanding of human intelligence led to the development of mathematical logic, the study of methods of proving the truth of statements by manipulating the symbols in which they are written without regard to the meanings of those symbols. By the nineteenth century a search was under way for a universal system of logic, one capable of proving anything provable in any other system.

Denning, Peter J.↗
DOE OSTI2024

Investigating Formal Methods Tools and their Applicability for Hardware Vulnerability Remediation

Formal methods use mathematical logic and equations to prove that a system or code is secure. In this poster, I examine existing formal methods tools and their application for projects working to remediate vulnerabilities in hardware and hardware description language. This poster is focused on the tools ReWire and AutoGenILA and I hope to evaluate their benefits and weaknesses with the intention of creating an internal report on the application and weaknesses of existing formal methods tools and identifying gaps for future formal methods tool creation.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Properties of Existentially Closed Companions

Necessary and sufficient conditions are stated for an arbitrary theory to be an elementary theory for a class of its existentially closed models. Conditions are given under which some existentially closed model simultaneously realizes one maximal existential type and omits another. We also prove a theorem on a prime existentially closed model over a maximal existential type. Considerable complexity of existentially closed structures and their theories was noted by A. Macintyre. Therefore, the examples of existentially closed companions having any finite or countable number of pairwise non elementarily equivalent existentially closed models constructed here are of interest.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1970

The Benchmark satellite Final report

Methods for satellite measurement of continental drift with earth rotation and mathematical logic for active attitude control of spin stabilized spacecraft

Winn, C. B.↗
NASA NTRS1991

Verification of VLSI designs

In this paper we explore the specification and verification of VLSI designs. The paper focuses on abstract specification and verification of functionality using mathematical logic as opposed to low-level boolean equivalence verification such as that done using BDD's and Model Checking. Specification and verification, sometimes called formal methods, is one tool for increasing computer dependability in the face of an exponentially increasing testing effort.

Windley, P. J.↗
NASA NTRS2004

Discrepancy Reporting Management System

Discrepancy Reporting Management System (DRMS) is a computer program designed for use in the stations of NASA's Deep Space Network (DSN) to help establish the operational history of equipment items; acquire data on the quality of service provided to DSN customers; enable measurement of service performance; provide early insight into the need to improve processes, procedures, and interfaces; and enable the tracing of a data outage to a change in software or hardware. DRMS is a Web-based software system designed to include a distributed database and replication feature to achieve location-specific autonomy while maintaining a consistent high quality of data. DRMS incorporates commercial Web and database software. DRMS collects, processes, replicates, communicates, and manages information on spacecraft data discrepancies, equipment resets, and physical equipment status, and maintains an internal station log. All discrepancy reports (DRs), Master discrepancy reports (MDRs), and Reset data are replicated to a master server at NASA's Jet Propulsion Laboratory; Master DR data are replicated to all the DSN sites; and Station Logs are internal to each of the DSN sites and are not replicated. Data are validated according to several logical mathematical criteria. Queries can be performed on any combination of data.

Cooper, Tonja M.↗
NASA NTRSDate not supplied

Let’s speak FRETish

FRET (https://github.com/NASA-SW-VnV/fret [github.com]) is a framework for the elicitation, formalization and analysis of requirements. FRET allows its user to enter requirements in a structured natural language called FRETish. Requirements written in FRETish are assigned unambiguous semantics. FRET supports its users in understanding this semantics and repairing requirements if applicable, by utilizing a variety of forms for each requirement: natural language description, formal mathematical logics, diagrams, and interactive simulation. FRET exports requirements into forms that can be used by a variety of analysis tools, including state-of-the-art model checkers and runtime monitoring tools. The talk will cover some of the theory behind the framework, present case studies from the aerospace and robotics domains, as well as current work on extending FRET for specifying requirements for software that learns.

FRET↗
DOE OSTI2018

Continuous solutions to a class of first-order fuzzy differential equations with discontinuous coefficients

In this paper, we study the continuity of solution functions to a class of fuzzy differential equations (FDEs) in the form y{sup ′}(t)=((φ(t))/((t−α){sup p}))⊙y(t)+ψ(t), where the coefficient function ((φ(t))/((t−α){sup p})) is a discontinuous function at the point t=α and α is an inner point of the interval under study. At first, the continuity of solutions for the crisp case of the problem is investigated and those results are extended to the fuzzy case of the problem from the view point of strongly generalized differentiability (G-differentiability). Next, we obtain explicit formulas of solutions and the conditions of their existence for a special class of these problems. Finally, the results are illustrated by solving some examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

TOPSIS method based on the connection number of set pair analysis under interval-valued intuitionistic fuzzy set environment

The objective of this paper is to focus on multi-attribute decision-making for interval-valued intuitionistic fuzzy set environment based on set pair analysis (SPA). For it, the major component of the SPA known as connection number has been constructed based on the set pairs between two preference values consists of every attribute and ideal pairs of it. Based on these connection numbers, an extension of technique for order of preference by similarity to ideal solution method is developed by combining the proposed connection number for IVIFSs and hence finding the best alternative(s) using relative degree of closeness coefficient. An illustrative example has been given for demonstrating the approach and compares their performance with some existing measures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Runge–Kutta method for solving fuzzy differential equations under generalized differentiability

In this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. Utilizing the Generalized Characterization Theorem, we investigate the problem of finding a numerical approximation of solutions. The Runge–Kutta approximation method is implemented and its error analysis, which guarantees pointwise convergence, is given. The method applicability is illustrated by solving a linear first-order fuzzy differential equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

TOPSIS with similarity measure for MADM applied to network selection

In this article, a new method is introduced to handle fuzzy multi-attribute decision-making problems. The method preserves fuzziness in the preference technique to avoid the drawbacks of defuzzification. The study modifies the technique of order preference by similarity to an ideal solution (TOPSIS) for interval-valued fuzzy numbers. The traditional TOPSIS uses the relative degree of closeness to rank the alternatives. Instead, a similarity measure based on map distance is used for preference. The degree of similarity between each attribute of an alternative and the ideal solution is computed, and a similarity matrix is formed. Then, the total degree of similarity for all the attributes of an alternative is used for ranking. The alternative corresponding to the one norm of the similarity matrix is the best alternative. Thus, the comparison is done on a fuzzy basis to avoid the loss of information due to converting the elements of the weighted normalized decision matrix to crisp values by defuzzification. An illustrative example is given to demonstrate the approach. A practical example in network selection to optimize vertical hand offs is solved where both user preferences and network parameters are treated as interval-valued fuzzy numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Designing Secure and Resilient Cyber-Physical Systems Using Formal Models

This work-in-progress paper proposes a design methodology that addresses the complexity and heterogeneity of cyber-physical systems (CPS) while simultaneously proving resilient control logic and security properties. The design methodology involves a formal methods-based approach by translating the complex control logic and security properties of a water flow CPS into timed automata. Timed automata are a formal model that describes system behaviors and properties using mathematics-based logic languages with precision. Due to the semantics that are used in developing the formal models, verification techniques, such as theorem proving and model checking, are used to mathematically prove the specifications and security properties of the CPS. This work-in-progress paper aims to highlight the need for formalizing plant models by creating a timed automata of the physical portions of the water flow CPS. Extending the time automata with control logic, network security, and privacy control processes is investigated. The final model will be formally verified to prove the design specifications of the water flow CPS to ensure efficacy and security.

42 ENGINEERING↗
NASA NTRS2011

Simulation and Verification of Synchronous Set Relations in Rewriting Logic

This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property veri cation of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure consists of an ordersorted rewrite theory in Maude, a rewriting logic system, that enables the synchronous execution of a set relation provided by the user. By using the infrastructure, existing algorithm veri cation techniques already available in Maude for traditional asynchronous rewriting, such as reachability analysis and model checking, are automatically available to synchronous set rewriting. The use of the infrastructure is illustrated with an executable operational semantics of a simple synchronous language and the veri cation of temporal properties of a synchronous system.

Rocha, Camilo↗
DOE OSTI2018

On the Depth of k-Valued Logic Functions Over Arbitrary Bases

The behavior of the Shannon function of the depth of k-valued logic functions realized by circuits over an arbitrary complete basis is examined. For all k, k ≥ 3, for an arbitrary basis of k-valued logic functions, the existence of the asymptotic behavior of the Shannon function of the depth is established. The asymptotic behavior is linear for finite bases and it is constant or logarithmic for infinite bases. Thus, the complete picture of asymptotic behavior of the Shannon function of the depth is obtained for all k, k ≥ 2.

97 MATHEMATICS AND COMPUTING↗