Preview
Unable to display preview. Download preview PDF.
9. References
Brookes, S.D., Roscoe, A.W. An improved failures model for communicating processes. In: Seminar on Concurrency (S.D. Brookes, A.W. Roscoe, G. Winskel, eds.). Springer, Berlin, 1985 (Lecture Notes in Computer Science: 197), 281–305.
Hoare, C.A.R. Communicating sequential processes. Comm. ACM 21 (1978), 666–677.
Hoare, C.A.R. Communicating Sequential Processes. Prentice Hall, New York, 1985.
Kaldewaij, A. A Formalism for Concurrent Processes. Doctoral Dissertation, Eindhoven University of Technology, Eindhoven, 1986.
Kung, H.T. Let's design algorithms for VLSI systems. In: Proc. 1st Caltech Conference (C.L. Seitz, ed.). California Institute of Technology, Pasadena, 1979, 65–90.
Martin, A.J. Compiling communicating processes into delay-insensitive VLSI circuits. Distributed Computing 1 (1986), 226–234.
Rem, M. Concurrent computations and VLSI circuits. In: Control Flow and Data Flow: Concepts in Distributed Programs (M. Broy, ed.). Springer, Berlin, 1985, 399–437.
Snepscheut, J.L.A. van de. Trace Theory and VLSI Design. Springer, Berlin, 1985 (Lecture Notes in Computer Science: 200).
Snepscheut, J.L.A. van de, Swenker, J. On the design of some systolic algorithms. Note JAN 131, Groningen University, Groningen, 1986.
Udding, J.T. A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing 1 (1986), 197–204.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rem, M. (1987). Trace theory and systolic computations. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17943-7_118
Download citation
DOI: https://doi.org/10.1007/3-540-17943-7_118
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17943-6
Online ISBN: 978-3-540-47144-8
eBook Packages: Springer Book Archive