Space-Time Algorithms: Semantics and Methodology

Chen, Marina Chien-mei (1983) Space-Time Algorithms: Semantics and Methodology. Technical Report. California Institute of Technology. [CaltechCSTR:1983.5090-tr-83]

Full text available as:

	Other (Adobe PDF (69MB))
	Postscript - Requires a viewer, such as GhostView

Abstract

A methodology for specifying concurrent systems is presented. A model of computation for concurrent systems is presented first. The syntax and semantics of the language CRYSTAL are introduced. The specification of a system is called a space-time algorithm since space and time are explicit parameters in the description. Fixed-point semantics is used for abstracting the behavior of a system from its implementation. The consistency between an implementation and its description can therefore be ensured using this method. Formal semantics for an arbitrary transistor network is given. An "interpreter" for space-time algorithms - a hierarchical simulator - for VLSI systems is presented. The framework can be viewed as a concurrent programming notation when describing communicating processes and as a hardware description notation when specifying integrated circuits.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	423
Deposited By:	Caltech Library System
Deposited On:	09 August 2002
Record Number:	CaltechCSTR:1983.5090-tr-83
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1983.5090-tr-83
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record