This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G.M. Baudet, Design and complexity of VLSI algorithms. in J.W. De Bakker and J. Van Leeuwen (eds) Foundations of Computer Science IV, Mathematical Centre Tracts, 158, Amsterdam, 1983.
R.E. Blahut, Fast algorithms for digital signal processing. Addison Wesley, Reading Massachusetts, 1985.
R.P. Brent and H.T. Kung, The area time complexity of multiplication. JACM 28, 521–534, 1981.
J.W. De Bakker, Mathematical theory of program correctness. Prentice Hall International series in Computer Science, London, 1980.
J.W. De Bakker, A.J. Nijman and P.C. Treleaven, Parallel Architectures and Languages Europe (PARLE). Springer LNCS Volumes 258 and 259, 1987.
S. Eker and J.V. Tucker, Specification, derivation and verification of concurrent line drawing algorithms and architectures, in R.A. Earnshaw (ed), Theoretical foundations of computer graphics and CAD, Proceedings of NATO Advanced Study Institute, Springer Verlag, Berlin, 1987.
H. Friedman, Algorithmic procedures, generalised Turing algorithms and elementary recursion theory, in R.O. Gandy and C.E.M. Yates (eds) Logic Colloquium '69, North Holland, Amsterdam, 1971.
N. Harman and J.V. Tucker, The formal specification of a digital correlator I: user specification. Centre for Theoretical Computer Science Report 9.87, Leeds University.
K. Hobley, B.C. Thompson and J.V. Tucker, Specification and verification of synchronous concurrent algorithms: a case study of a convolution architecture, Centre for Theoretical Computer Science, University of Leeds, Report 14.88, to appear in G. Milne (ed), (Proceedings of IFIP Working Group 10.2 Working Conference on) The fusion of hardware design and verification, North Holland, to appear, 1988.
H.T. Kung, Let's design algorithms for VLSI systems. Proc Caltech Conf on VLSI: Architecture, Design, Fabrication, pp 65–90, 1979.
A.R. Martin and J.V. Tucker, The concurrent assignment representation of synchronous systems, in Parallel Architectures and Languages Europe Volume II. Springer LNCS Volume 259, 369–386, 1987.
K. Meinke, A graph-theoretic model of synchronous concurrent algorithms. PhD Dissertation, University of Leeds, 1988.
G. Milne and P.A. Subrahmanyam, Formal aspects of VLSI design. North Holland, Amsterdam, 1986.
J.E. Savage, The performance of multilective VLSI algorithms. J. Computer and Systems Science, 29, 243–273, 1984.
B.C. Thompson, A mathematical model of synchronous concurrent algorithms. PhD Dissertation, University of Leeds, 1987.
C.D. Thompson, A complexity theory for VLSI. PhD Dissertation, Carnegie Mellon University, 1980.
B.C. Thompson and J.V. Tucker, Theoretical considerations in algorithm design, in R.A. Earnshaw (ed) Fundamental algorithms for computer graphics, Springer Verlag, 855–878, 1985.
B.C. Thompson and J.V. Tucker, A parallel deterministic language and its application to synchronous concurrent algorithms, Centre for Theoretical Computer Science, University of Leeds, Report 18.88, 1988.
J.V. Tucker and J.I. Zucker, Program correctness over abstract data types with error state semantics. North Holland, 1988.
J.E. Vuillemin, A combinatorial limit to the computing power of VLSI circuits. IEEE Transactions on Computers, C-32, 294–300, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meinke, K., Tucker, J.V. (1988). The scope and limits of synchronous concurrent computation. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-50403-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50403-0
Online ISBN: 978-3-540-45999-6
eBook Packages: Springer Book Archive