Search NASASearch

Engineering topics

Miller, Raymond E.

Publications and source records attributed to Miller, Raymond E..

Cost efficient operations: Challenge from NASA administrator and lessons learned from hunting sacred cows

The conclusions and recommendations that resulted from NASA's Hunting Sacred Cows Workshop are summarized, where a sacred cow is a belief or assumption that is so well established that it appears to be unreasonably immune to criticism. A link was identified between increased complexity and increased costs, especially in relation to automation and autonomy. An identical link was identified for outsourcing and commercialization. The work of NASA's Cost Less team is reviewed. The following conclusions were stated by the Cost Less team and considered at the workshop: the way Nasa conducts business must change; NASA makes its best contributions to the public areas not addressed by other government organizations; the management tool used for the last 30 years is no longer suitable; the most important work on any program or project is carried out before the development or operations stages; automation should only be used to achieve autonomy if the reasons for automation are well understood, and NASA's most critical resources are its personnel.

Hornstein, Rhoda Shaller

Reducing the complexity of NASA's space communications infrastructure

This report describes the range of activities performed during the annual reporting period in support of the NASA Code O Success Team - Lifecycle Effectiveness for Strategic Success (COST LESS) team. The overall goal of the COST LESS team is to redefine success in a constrained fiscal environment and reduce the cost of success for end-to-end mission operations. This goal is more encompassing than the original proposal made to NASA for reducing complexity of NASA's Space Communications Infrastructure. The COST LESS team approach for reengineering the space operations infrastructure has a focus on reversing the trend of engineering special solutions to similar problems.

Miller, Raymond E.

Synthesizing a protocol converter from executable protocol traces

Communicating finite state machines (CFSM's) with FIFO (first in, first out) queues are used to model a protocol converter. A protocol conversion algorithm is developed and presented for the CSFM model of the protocols A and B. A converter H for protocols A = (A0, A1) and B = (B0, B1) is viewed as a black box such that H is between sender A0 and receiver B1. This gives a resulting protocol X = (A0, H, B1). The conversion algorithm requires a specification of the message relationships between the messages of protocols A and B. It is assumed that protocols A and B have the required progress properties. The algorithm includes a search for related messages from the two protocols in an FIFO from a composite space formed by a Cartesian cross-product of state spaces A1 and B0. The search produces finite-length traces which are combined to form a state machine H, which is examined for freedom from unspecified receptions, deadlocks, and livelocks. A protocol conversion example demonstrates the applicability of the algorithm.

Rajagopal, Murali