Search NASA⌕ Search

SEARCH · Search NASA

Results for “algebraic specification”

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

Selecting reusable components using algebraic specifications

A significant hurdle confronts the software reuser attempting to select candidate components from a software repository - discriminating between those components without resorting to inspection of the implementation(s). We outline a mixed classification/axiomatic approach to this problem based upon our lattice-based faceted classification technique and Guttag and Horning's algebraic specification techniques. This approach selects candidates by natural language-derived classification, by their interfaces, using signatures, and by their behavior, using axioms. We briefly outline our problem domain and related work. Lattice-based faceted classifications are described; the reader is referred to surveys of the extensive literature for algebraic specification techniques. Behavioral support for reuse queries is presented, followed by the conclusions.

Eichmann, David A.↗

Compositional Specification of Software Architecture

This paper describes our experience using parameterized algebraic specifications to model properties of software architectures. The goal is to model the decomposition of requirements independent of the style used to implement the architecture. We begin by providing an overview of the role of architecture specification in software development. We then describe how architecture specifications are build up from component and connector specifications and give an overview of insights gained from a case study used to validate the method.

Penix, John↗

A special purpose symbolic manipulation program for the derivation of the equations of motion for large flexible structures

This paper outlines a computer program especially tailored to the task of deriving explicit equations of motion for structures with point-connected substructures. The special purpose program is written in FORTRAN and is designed for performing the specific algebraic operations encountered in the derivation of explicit equations of motion. The derivation is by the Lagrangian approach. Using an orderly kinematical procedure and a discretization and/or truncation scheme, it is possible to write the kinetic and potential energy of each substructure in a compact vector-matrix form. Then, if each element of the matrices and vectors encountered in the kinetic and potential energy is a known algebraic expression, the computer program performs the necessary operations to evaluate the kinetic and potential energy of the system explicitly. Lagrange's equations for small motions about equilibrium can be deduced directly from the explicit form of the system kinetic and potential energy.

Hale, A. L.↗

Derivation of the equations of motion for complex structures by symbolic manipulation

This paper outlines a computer program especially tailored to the task of deriving explicit equations of motion for structures with point-connected substructures. The special purpose program is written in FORTRAN and is designed for performing the specific algebraic operations encountered in the derivation of explicit equations of motion. The derivation is by the Lagrangian approach. Using an orderly kinematical procedure and a discretization and/or truncation scheme, it is possible to write the kinetic and potential energy of each substructure in a compact vector-matrix form. Then, if each element of the matrices and vectors encountered in the kinetic and potential energy is a known algebraic expression, the computer program performs the necessary operations to evaluate the kinetic and potential energy of the system explicitly. Lagrange's equations for small motions about equilibrium can be deduced directly from the explicit form of the system kinetic and potential energy.

Hale, A. L.↗

Computational aspects of unsteady flows

The calculation of unsteady flows and the development of numerical methods for solving unsteady boundary layer equations and their application to the flows around important configurations such as oscillating airfoils are presented. A brief review of recent work is provided with emphasis on the need for numerical methods which can overcome possible problems associated with flow reversal and separation. The zig-zag and characteristic box schemes are described in this context, and when embodied in a method which permits interaction between solutions of inviscid and viscous equations, the characteristic box scheme is shown to avoid the singularity associated with boundary layer equations and prescribed pressure gradient. Calculations were performed for a cylinder started impulsively from rest and oscillating airfoils. The results are presented and discussed. It is conlcuded that turbulence models based on an algebraic specification of eddy viscosity can be adequate, that location of translation is important to the calculation of the location of flow separation and, therefore, to the overall lift of an oscillating airfoil.

Cebeci, T.↗

Application of Artificial Intelligence technology to the analysis and synthesis of reliable software systems

The development of a methodology for the production of highly reliable software is one of the greatest challenges facing the computer industry. Meeting this challenge will undoubtably involve the integration of many technologies. This paper describes the use of Artificial Intelligence technologies in the automated analysis of the formal algebraic specifications of abstract data types. These technologies include symbolic execution of specifications using techniques of automated deduction and machine learning through the use of examples. On-going research into the role of knowledge representation and problem solving in the process of developing software is also discussed.

Wild, Christian↗

The SoRReL papers: Recent publications of the Software Reuse Repository Lab

The entire publication is presented of some of the papers recently published by the SoRReL. Some typical titles are as follows: Design of a Lattice-Based Faceted Classification System; A Hybrid Approach to Software Reuse Repository Retrieval; Selecting Reusable Components Using Algebraic Specifications; Neural Network-Based Retrieval from Reuse Repositories; and A Neural Net-Based Approach to Software Metrics.

Eichmann, David A.↗

Motion Planning in a Society of Intelligent Mobile Agents

The majority of the work on this grant involved formal modeling of human-computer integration. We conceptualize computer resources as a multiagent system so that these resources and human collaborators may be modeled uniformly. In previous work we had used modal for this uniform modeling, and we had developed a process-algebraic agent abstraction. In this work, we applied this abstraction (using CSP) in uniformly modeling agents and users, which allowed us to use tools for investigating CSP models. This work revealed the power of, process-algebraic handshakes in modeling face-to-face conversation. We also investigated specifications of human-computer systems in the style of algebraic specification. This involved specifying the common knowledge required for coordination and process-algebraic patterns of communication actions intended to establish the common knowledge. We investigated the conditions for agents endowed with perception to gain common knowledge and implemented a prototype neural-network system that allows agents to detect when such conditions hold. The literature on multiagent systems conceptualizes communication actions as speech acts. We implemented a prototype system that infers the deontic effects (obligations, permissions, prohibitions) of speech acts and detects violations of these effects. A prototype distributed system was developed that allows users to collaborate in moving proxy agents; it was designed to exploit handshakes and common knowledge Finally. in work carried over from a previous NASA ARC grant, about fifteen undergraduates developed and presented projects on multiagent motion planning.

Esterline, Albert C.↗

Spatial-Operator Algebra For Robotic Manipulators

Report discusses spatial-operator algebra developed in recent studies of mathematical modeling, control, and design of trajectories of robotic manipulators. Provides succinct representation of mathematically complicated interactions among multiple joints and links of manipulator, thereby relieving analyst of most of tedium of detailed algebraic manipulations. Presents analytical formulation of spatial-operator algebra, describes some specific applications, summarizes current research, and discusses implementation of spatial-operator algebra in the Ada programming language.

Rodriguez, Guillermo↗

Selected computations of transonic cavity flows

An efficient diagonal scheme implemented in an overset mesh framework has permitted the analysis of geometrically complex cavity flows via the Reynolds averaged Navier-Stokes equations. Use of rapid hyperbolic and algebraic grid methods has allowed simple specification of critical turbulent regions with an algebraic turbulence model. Comparisons between numerical and experimental results are made in two dimensions for the following problems: a backward-facing step; a resonating cavity; and two quieted cavity configurations. In three-dimensions the flow about three early concepts of the stratospheric Observatory For Infrared Astronomy (SOFIA) are compared to wind-tunnel data. Shedding frequencies of resolved shear layer structures are compared against experiment for the quieted cavities. The results demonstrate the progress of computational assessment of configuration safety and performance.

Atwood, Christopher A.↗

Strategy-Enhanced Interactive Proving and Arithmetic Simplification for PVS

We describe an approach to strategy-based proving for improved interactive deduction in specialized domains. An experimental package of strategies (tactics) and support functions called Manip has been developed for PVS to reduce the tedium of arithmetic manipulation. Included are strategies aimed at algebraic simplification of real-valued expressions. A general deduction architecture is described in which domain-specific strategies, such as those for algebraic manipulation, are supported by more generic features, such as term-access techniques applicable in arbitrary settings. An extended expression language provides access to subterms within a sequent.

diVito, Ben L.↗

Strategy-Enhanced Interactive Proving and Arithmetic Simplification for PVS

We describe an approach to strategy-based proving for improved interactive deduction in specialized domains. An experimental package of strategies (tactics) and support functions called Manip has been developed for PVS to reduce the tedium of arithmetic manipulation. Included are strategies aimed at algebraic simplification of real-valued expressions. A general deduction architecture is described in which domain-specific strategies, such as those for algebraic manipulation, are supported by more generic features, such as term-access techniques applicable in arbitrary settings. An extended expression language provides access to subterms within a sequent.

DiVito, Ben L.↗

Turbulence modelling for complex shear flows

The turbulence models available for the prediction of complex turbulent shear layers are reviewed in this paper, concentrating mainly on three-dimensional flows, flows subjected to curvature and body rotation, separated flows, and vortex flows. A critical review of zero-equation, one-equation, two-equation, algebraic Reynolds stress, and full Reynolds stress models are carried out, with a specific emphasis on their applicability to complex flows. It is concluded that algebraic eddy viscosity models and kappa-epsilon/kappa-omega models, with a constant value of coefficients, are not adequate for complex flows. The models which include a description of stresses, either through an algebraic Reynolds stress model or a full Reynolds stress model, are essential for adequate prediction of these flows. It is recommended that systematic experimental investigations be carried out to isolate various complex interactions in order to understand and model the various effects and to carry out an extension of the present models to include complex flows.

Lakshminarayana, B.↗

Calculation of transonic aileron buzz

An implicit finite-difference computer code that uses a two-layer algebraic eddy viscosity model and exact geometric specification of the airfoil has been used to simulate transonic aileron buzz. The calculated results, which were performed on both the Illiac IV parallel computer processor and the Control Data 7600 computer, are in essential agreement with the original expository wind-tunnel data taken in the Ames 16-Foot Wind Tunnel just after World War II. These results and a description of the pertinent numerical techniques are included.

Steger, J. L.↗

Finite element concepts in computational aerodynamics

Finite element theory was employed to establish an implicit numerical solution algorithm for the time averaged unsteady Navier-Stokes equations. Both the multidimensional and a time-split form of the algorithm were considered, the latter of particular interest for problem specification on a regular mesh. A Newton matrix iteration procedure is outlined for solving the resultant nonlinear algebraic equation systems. Multidimensional discretization procedures are discussed with emphasis on automated generation of specific nonuniform solution grids and accounting of curved surfaces. The time-split algorithm was evaluated with regards to accuracy and convergence properties for hyperbolic equations on rectangular coordinates. An overall assessment of the viability of the finite element concept for computational aerodynamics is made.

Baker, A. J.↗

Developing integrated parametric planning models for budgeting and managing complex projects

The applicability of integrated parametric models for the budgeting and management of complex projects is investigated. Methods for building a very flexible, interactive prototype for a project planning system, and software resources available for this purpose, are discussed and evaluated. The prototype is required to be sensitive to changing objectives, changing target dates, changing costs relationships, and changing budget constraints. To achieve the integration of costs and project and task durations, parametric cost functions are defined by a process of trapezoidal segmentation, where the total cost for the project is the sum of the various project cost segments, and each project cost segment is the integral of a linearly segmented cost loading function over a specific interval. The cost can thus be expressed algebraically. The prototype was designed using Lotus-123 as the primary software tool. This prototype implements a methodology for interactive project scheduling that provides a model of a system that meets most of the goals for the first phase of the study and some of the goals for the second phase.

Etnyre, Vance A.↗

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Johnson, Duane↗