Diagrammatic reasoning for delay-insensitive asynchronous circuits
From MaRDI portal
Publication:4922073
Recommendations
- Diagrammatic Semantics for Digital Circuits.
- scientific article; zbMATH DE number 2217813
- scientific article; zbMATH DE number 4201658
- Modelling and verification of delay-insensitive circuits using CCS and the concurrency workbench
- Extensions of asynchronous circuits and the delay problem. I: Good extensions and the delay problem of the first kind
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- A formal approach to designing delay-insensitive circuits
- Categorical quantum mechanics
- Geometry of synthesis III
- Geometry of synthesis. II: From games to delay-insensitive circuits
- Geometry of synthesis: a structured approach to VLSI design
- Higher-dimensional word problems with applications to equational logic
- On the Hopf algebraic origin of Wick normal ordering.
- Syntactic control of concurrency
- Towards an algebraic theory of Boolean circuits.
Cited in
(12)- Asynchronous logic circuits and sheaf obstructions
- Bialgebraic foundations for the operational semantics of string diagrams
- A structural and nominal syntax for diagrams
- String diagram rewrite theory III: Confluence with and without Frobenius
- Contextual equivalence for signal flow graphs
- Confluence of graph rewriting with interfaces
- The calculus of signal flow diagrams. I: Linear relations on streams.
- scientific article; zbMATH DE number 7649945 (Why is no real title available?)
- Interacting Hopf algebras
- scientific article; zbMATH DE number 1786640 (Why is no real title available?)
- Diagrammatic Semantics for Digital Circuits.
- Towards compositional graph theory
This page was built for publication: Diagrammatic reasoning for delay-insensitive asynchronous circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922073)