Thesis--Wisconsin. / Includes bibliographical references.

Thesis (Ph.D.)--University of Oklahoma, 1985. / Bibliography: leaves 137-141.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1976. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 110-112).

Thesis--University of Florida. / Description based on print version record. Typescript. Vita. Bibliography: leaves 172-177.

Thesis (M.S.)--Oregon Graduate Center, 1986.

No description available.

No description available.

Depending on the scale of the problem, continuous system simulation is usually carried out on large computer systems or in personal computers running continuous system simulation languages; there is little in between. This thesis describes the development of an inexpensive parallel-processing simulator in which outwardly identical processing elements are configured to digitally simulate continuous system transfer functions and the other components needed to model the computing and control functions of physical systems.

No description available.

The present Thesis addresses the problem of specification and verification of communicating systems with value passing. We assume that such systems are described in the well-known Calculus of Communicating Systems, or rather, in its value passing version. As a specification language we propose an extension of the Modal μ-Calculus, a poly-modal first-order logic with recursion. For this logic we develop a proof system for verifying judgements of the form b ⊢ Ε : Φ where E is a sequential CCS term and b is a Boolean assumption about the value variables occurring free in E and Φ. Proofs conducted in this proof system follow the structure of the process term and the formula. This syntactic approach makes proofs easier to comprehend and machine assist. To avoid the introduction of global proof rules we adopt a technique of tagging fixpoint formulae with all relevant information needed for the discharge of reoccurring sequents. We provide such tagged formulae with a suitable semantics. The resulting proof system is shown to be sound in general and complete (relative to external reasoning about values) for a large class of sequential processes and logic formulae. We explore the idea of using tags to three different settings: value passing, extended sequents. and negative tagging. / Graduate