Abstract
First, we study the general idea of a spatially extended system (SES) and argue that many mathematical models of systems in computing and natural science are examples of SESs. We examine the computability and the equational definability of SESs and show that, in the discrete case, there is a natural sense in which an SES is computable if, and only if, it is definable by equations. We look at a simple idea of hierarchical structure for SESs and, using respacings and retimings, we define how one SES abstracts, approximates, or is implemented by another SES. Secondly, we study a special kind of SES called a synchronous concurrent algorithm (SCA). We define the simplest kind of SCA with a global clock and unit delay which are computable and equationally definable by primitive recursive equations over time. We focus on two examples of SCAs: a systolic array for convolution and a non-linear model of cardiac tissue. We investigate the hierarchical structure of SCAs by applying the earlier general concepts for the hierarchical structure of SESs. We apply the resulting SCA hierarchy to the formal analysis of both the implementation of a systolic array and the approximation of a biologically detailed model of cardiac tissue
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R R Aliev and A V Panfilov. A simple two-variable model of cardiac excitation. Chaos, Solitons and Fractals, 7:293–301, 1996.
J A Bergstra, J A Hillebrand, and A Ponse. Grid protocols based on synchronous communication. Science of Computer Programming, 29(1-2):199–233, 1997.
J Blanck. Domain representability of metric spaces. Annals of Pure and Applied Logic, 83:225–247, 1997.
J A Bergstra and A Ponse. Grid protocol specifications. 1999. In this volume.
J A Bergstra and J V Tucker. The completeness of the algebraic specification methods for computable data types. Information and Control, 54:186–200, 1982.
S M Eker, V Stavridou, and J V Tucker. Verification of synchronous concurrent algorithms using OBJ3. A case study of the pixel planes architecture. In Proceedings of a Workshop on Designing Correct Circuits. Springer-Verlag, 1990.
A C J Fox and N A Harman. Algebraic models of superscalar microprocessor implementations: A case study. 1999. In this volume.
A C J Fox. Algebraic Models for Advanced Microprocessors. PhD thesis, Department of Computer Science, University of Wales Swansea, 1998.
R L Grossman, A Nerode, A P Ravn, and H Rischel, editors. Hybrid systems. Lecture Notes in Computer Science 736. Springer-Verlag, 1993.
A V Holden, M J Poole, and J V Tucker. Reconstructing the heart. Chaos, Solitons and Fractals, 5:691–704, 1995.
A V Holden, M J Poole, and J V Tucker. An algorithmic model of the mammalian heart: propagation, vulnerability, re-entry and fibrillation. International Journal of Bifurcation and Chaos, 6:1623–1635, 1996.
A V Holden, M J Poole, and J V Tucker. A theoretical framework for analysis and synthesis of networks of neurones. In R Moreno-Díaz and J Mira-Mira, editors, Brain Processes, Theories and Models, pages 320–329. MIT Press, 1996.
A V Holden, M J Poole, and J V Tucker. Hierarchical reconstructions of cardiac tissue. Technical Report CSR 6-98, Department of Computer Science, University of Wales Swansea, 1998.
A V Holden, M J Poole, J V Tucker, and H Zhang. Coupling CMLs and the synchronisation of a multilayer neural computing system. Chaos, Solitons and Fractals, 4:2249–2268, 1994.
N A Harman and J V Tucker. Algebraic specifications and the correctness of microcomputers. In G J Milne and E L Pierre, editors, Correct hardware design and verification methods, Lecture Notes in Computer Science 683, pages 92–108. Springer-Verlag, 1993.
N A Harman and J V Tucker. Algebraic models of microprocessors: Architecture and organisation. Acta Informatica, 33:421–456, 1996.
K M Hobley, B C Thompson, and J V Tucker. Specification and verification of synchronous concurrent algorithms: a case study of a convolution algorithm. In G Milne, editor, The Fusion of Hardware Design and Verification, pages 347–374. North-Holland, 1988.
A V Holden, J V Tucker, and B C Thompson. Can excitable media be considered as computational systems? Physica D, 49:240–246, 1991.
A V Holden, J V Tucker, H Zhang, and M J Poole. Coupled map lattices as computational systems. Chaos, 2:367–376, 1992.
K Kaneko, editor. Coupled Map Lattices: Theory and Applications. John Wiley, 1992.
H T Kung. Why systolic architectures? Computer, pages 37–46, January 1982.
Y N Moschovakis. Recursive metric spaces. Fundamenta Mathematicae, 55:215–238, 1964.
K Meinke and J V Tucker. Universal algebra. In D Gabbay S Abramsky and T S E Maibaum, editors, Handbook of Logic in Computer Science, volume 1, pages 189–411. Oxford University Press, 1992.
D Noble. Oxsoft Heart program, Oxsoft Ltd, Oxford, 1990.
A V Panfilov and A V Holden, editors. Computational Biology of the Heart. John Wiley & Sons, 1997.
D E Rumelhart and J L McClelland, editors. Parallel Distributed Processing. Explorations in the Microstructure of Cognition. (Two volumes). MIT Press, 1986.
J E Savage. Models of Computation. Addison-Wesley, 1998.
V Stoltenberg-Hansen and J V Tucker. Complete local rings as domains. Journal of Symbolic Logic, 53:603–624, 1988.
V Stoltenberg-Hansen and J V Tucker. Effective algebras. In D Gabbay S Abramsky and T S E Maibaum, editors, Handbook of Logic in Computer Science, volume 4, pages 357–526. Oxford University Press, 1995.
V Stoltenberg-Hansen and J V Tucker. Concrete models of computation for topological algebras. Technical Report 34, University of Uppsala, Mathematics Department, 1997.
K Stephenson. Towards an algebraic specification of the JAVA virtual machine. 1999. In this volume.
B C Thompson and J V Tucker. Equational specification of synchronous concurrent algorithms and architectures (2nd edition). Technical Report CSR 15-94, Department of Computer Science, University of Wales Swansea, 1994.
J V Tucker. Theory of computation and specification over abstract data types and its applications. In F L Bauer, editor, Logic, Algebra and Computation, pages 1–39. Springer-Verlag, 1991.
J V Tucker and J I Zucker. Theory of computation over stream algebras, and its applications. In I M Havel and V Koubek, editors, Mathematical Foundations of Computer Science, Lecture Notes In Computer Science 629. Springer-Verlag, 1992.
K Weihrauch. Computability. EATCS Monographs on Theoretical Computer Science 9. Springer-Verlag, 1987.
M Wirsing. Algebraic specification. In J van Leeuwen, editor, The Handbook of Theoretical Computer Science, pages 675–788. Elsevier, 1991.
R L Winslow, A L Kimball, A Varghese, and D Noble. Simulating cardiac sinus and atrial network dynamics on the Connection Machine. Physica D, 64:282–298, 1993.
S Wolfram. Theory and applications of cellular automata. World Scientific, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Poole, M.J., Tucker, J.V., Holden, A.V. (1998). Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms. In: Möller, B., Tucker, J.V. (eds) Prospects for Hardware Foundations. Lecture Notes in Computer Science, vol 1546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49254-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-49254-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65461-2
Online ISBN: 978-3-540-49254-2
eBook Packages: Springer Book Archive