Synthesis and equivalence of concurrent systems
From MaRDI portal
DOI10.1016/0304-3975(88)90026-6zbMATH Open0648.68039OpenAlexW2073149273MaRDI QIDQ1105355FDOQ1105355
Authors: 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
Recommendations
equivalencecommunication structurecomputational networksFFT algorithmcell action structuresynthesis of synchronous concurrent systems with local memory
Cites Work
- Petri nets, event structures and domains. I
- Heterogeneous algebras
- Title not available (Why is that?)
- Parallel Processing with the Perfect Shuffle
- The parallel execution of DO loops
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spacetime representations of computational structures
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
- Topological transformations as a tool in the design of systolic networks
- Synthesizing synchronous systems by static scheduling in space-time
- On the Analysis and Synthesis of VLSI Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergent Systems: Analysis and Synthesis
- The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
- Title not available (Why is that?)
- Implementations of the CSP Notation for Concurrent Systems
- From synchronous programs to symbolic representations of hybrid systems
- Synthesis of Persistent Systems
This page was built for publication: Synthesis and equivalence of concurrent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105355)