A Caltech Library Service

Space-Time Algorithms: Semantics and Methodology

Chen, Marina Chien-mei (1983) Space-Time Algorithms: Semantics and Methodology. California Institute of Technology . (Unpublished)

Other (Adobe PDF (69MB))
See Usage Policy.

See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:1983.5090-tr-83
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:27012
Deposited By: Imported from CaltechCSTR
Deposited On:09 Aug 2002
Last Modified:03 Oct 2019 03:20

Repository Staff Only: item control page