Use this URL to cite or link to this record in EThOS:
Title: Synchronous concurrent algorithms and dynamical systems
Author: Poole, M. J.
Awarding Body: University College of Swansea
Current Institution: Swansea University
Date of Award: 1995
Availability of Full Text:
Access from EThOS:
A synchronous concurrent algorithm (SCA) is an algorithm that is described as a network of interconnected processors or modules, whose computation and communication are synchronised by a global clock. The concept of an SCA was originally introduced to model parallel deterministic computer systems, and as a neutral basis for formally reasoning about their structure, operation and correctness. The mathematical theory of SCAs is based on the theory of primitive recursive functions over many-sorted stream algebras. Examples of SCAs studied thus far include conventional digital hardware, systolic arrays and signal processing algorithms. In addition, many models of physical and biological systems have been identified as SCAs. These include cellular automata (CAs), coupled map lattices (CMLs), neural networks (NNs), and numerical approximations to partial differential equations (PDEs) and coupled ordinary differential equations (CODEs). The study of these spatially-extensive dynamical systems may be unified and enriched by the application of a wide range of mathematical tools from the theory of SCAs in particular, and from theoretical computer science in general. The first aim of this thesis is to integrate fully two of these classes, CAs and CMLs, into the formal computational framework of SCAs. We demonstrate the application of SCA theory of these dynamical systems, and present detailed SCA case studies of CA and CML models of wave propagation in excitable media and electrical signals in heart muscle. Our other primary objective is to provide practical software tools for the computer simulation, analysis and automatic testing of SCAs. We define formally a collection of new SCA programming languages, known as Caress II, in which parallelism is represented by the multiple or concurrent assignment. Caress II is designed to facilitate the representation of networks, tasks specifications and automatic testing procedures that are defined over arbitrary stream algebras.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available