Thesis (M.S.)--University of Wisconsin--Madison, 1969. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

München, Techn. Universiẗat, Diss., 2005.

München, Techn. Universiẗat, Diss., 2000.

The combinations of analog and digital equipment to form hybrid installations are of such variety that hybrid software routines are generally restricted to particular hardware configurations. The software developed in this thesis is applicable and operational on the EAI PACE-231R-V; DEC PDP-9 Hybrid Computer. The programs (in the form of subroutines and handlers) are structured, according to the characteristics of this computer, to handle the general situations of hybrid programming; such situations as the synchronization of the analog and digital computers, and the transfer of data and control information. The present level of software development has considerably simplified the use of the interface for hybrid problem applications. Successive stages of software development would incorporate this stage, in whole or in part; each stage being more comprehensive and sophisticated than its predecessor. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

No description available.

A rocket test system was developed and fabricated for the purpose of testing hybrid rocket motors. The test system includes a rocket test stand, load cell, and data acquisition system that is capable of safely and accurately recording thrust data from each burn. This paper documents the test system design and operation. The test system has been used to study the performance results from using multiple types of fuel utilized in hybrid motor systems. The types of hybrid motors used typically have thrust values below 1000 lbf. Along with different fuels, different motor configurations were also used during testing to determine if each hybrid rocket fuel reacted similarly under altering conditions.

This dissertation presents a new framework, trace-automata, for verifying hybrid systems. In addition, a simple, general theory of abstraction is presented, based on the idea of approximations that are liberal or conservative with respect to an abstraction function. This theory gives rise to a sound technique whereby hybrid systems are verified by constructing discrete approximations of both the implementation and the specification, and verifying that the approximate implementation satisfies the approximate specification. Trace-automata are language accepting, infinite tape automata, extended to allow multiple tapes, and to allow tapes that consist of continuous traces over the reals, as well as tapes that consist of sequences of discrete symbols. Hybrid systems are represented by automata that read some continuous tapes and some discrete tapes. Trace-automata are used to represent both the implementation and the specification of the system to be verified. Verification corresponds to demonstrating that the language accepted by the implementation is contained in that accepted by the specification. Hybrid systems are verified by constructing and verifying discrete approximations. Abstraction functions map continuous traces to discrete sequences. A liberal approximation of the system implementation is verified against a conservative approximation of the system specification. From this verification, it can be concluded that the original hybrid model satisfies the original specification. The dissertation describes a general technique for constructing discrete, liberal approximations of trace-automata representing differential equations and inclusions. In addition, trace-automata themselves can encode abstraction functions, with the result that trace-automata language containment can also be used to establish that an approximation is liberal or conservative as the case may be. These techniques are illustrated with an example verification based upon the Philips Audio Control Protocol with two agents, each capable of both transmitting and receiving. The verification is novel in that it is based upon a detailed model of the analog electrical behaviour of the bus.

This dissertation presents a new framework, trace-automata, for verifying hybrid systems. In addition, a simple, general theory of abstraction is presented, based on the idea of approximations that are liberal or conservative with respect to an abstraction function. This theory gives rise to a sound technique whereby hybrid systems are verified by constructing discrete approximations of both the implementation and the specification, and verifying that the approximate implementation satisfies the approximate specification. Trace-automata are language accepting, infinite tape automata, extended to allow multiple tapes, and to allow tapes that consist of continuous traces over the reals, as well as tapes that consist of sequences of discrete symbols. Hybrid systems are represented by automata that read some continuous tapes and some discrete tapes. Trace-automata are used to represent both the implementation and the specification of the system to be verified. Verification corresponds to demonstrating that the language accepted by the implementation is contained in that accepted by the specification. Hybrid systems are verified by constructing and verifying discrete approximations. Abstraction functions map continuous traces to discrete sequences. A liberal approximation of the system implementation is verified against a conservative approximation of the system specification. From this verification, it can be concluded that the original hybrid model satisfies the original specification. The dissertation describes a general technique for constructing discrete, liberal approximations of trace-automata representing differential equations and inclusions. In addition, trace-automata themselves can encode abstraction functions, with the result that trace-automata language containment can also be used to establish that an approximation is liberal or conservative as the case may be. These techniques are illustrated with an example verification based upon the Philips Audio Control Protocol with two agents, each capable of both transmitting and receiving. The verification is novel in that it is based upon a detailed model of the analog electrical behaviour of the bus. / Science, Faculty of / Computer Science, Department of / Graduate

Thesis (Ph. D.)--West Virginia University, 2004. / Title from document title page. Document formatted into pages; contains xviii, 196 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 161-166).

Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 54-56). Also available on the Internet.