Synthesis and equivalence of concurrent systems
type: Item
instance of: scholarly article
title: Synthesis and equivalence of concurrent systems
zbMATH Open document ID: 0648.68039
DOI: 10.1016/0304-3975(88)90026-6
author: Björn Lisper
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
review text: A framework for synthesis of synchronous concurrent systems with local memory is developed. Given an output specification of the system a cell action structure can be derived. This structure can be mapped into a communication structure, a model of the events in the target hardware with constraints on the communication possible between events, giving a schedule for the cell actions. Communication structures are interesting in their own right, and transformations defined on such can be used for showing equivalence between different computational networks. As an example, the equivalence between two specific communication structures is proved and it is shown that an FFT algorithm can be implemented on them.
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 4058847
zbMATH Keywords: synthesis of synchronous concurrent systems with local memory
zbMATH Keywords: cell action structure
zbMATH Keywords: communication structure
zbMATH Keywords: equivalence
zbMATH Keywords: computational networks
zbMATH Keywords: FFT algorithm
MaRDI profile type: Publication
full work available at URL: 0304-3975(88)90026-6
OpenAlex ID: W2073149273
cites work: Heterogeneous algebras
cites work: Topological transformations as a tool in the design of systolic networks
cites work: Q5572358
cites work: On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
cites work: Q4190126
cites work: Q3722428
cites work: The parallel execution of DO loops
cites work: Q3042387
cites work: Q3680270
cites work: Synthesizing synchronous systems by static scheduling in space-time
cites work: Q4040458
cites work: Q3690194
cites work: Spacetime representations of computational structures
cites work: On the Analysis and Synthesis of VLSI Algorithms
cites work: Petri nets, event structures and domains. I
cites work: Parallel Processing with the Perfect Shuffle
description: scientific article; zbMATH DE number 4058847