Synthesis and equivalence of concurrent systems

DOI10.1016/0304-3975(88)90026-6zbMath0648.68039OpenAlexW2073149273MaRDI QIDQ1105355

Björn Lisper

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90026-6

zbMATH Keywords

equivalencecommunication structurecomputational networksFFT algorithmcell action structuresynthesis of synchronous concurrent systems with local memory

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Cites Work

• Spacetime representations of computational structures
• Topological transformations as a tool in the design of systolic networks
• Petri nets, event structures and domains. I
• Synthesizing synchronous systems by static scheduling in space-time
• On the Analysis and Synthesis of VLSI Algorithms
• The parallel execution of DO loops
• Heterogeneous algebras
• Parallel Processing with the Perfect Shuffle
• On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthesis and equivalence of concurrent systems