Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits

DOI10.1007/978-3-642-38164-5_5zbMath1264.94126OpenAlexW32293111MaRDI QIDQ4922073

Dan R. Ghica

Publication date: 28 May 2013

Published in: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38164-5_5

Mathematics Subject Classification ID

Related Items

Interacting Hopf algebras ⋮ Unnamed Item ⋮ Contextual equivalence for signal flow graphs ⋮ Unnamed Item ⋮ Towards compositional graph theory ⋮ Confluence of Graph Rewriting with Interfaces ⋮ The calculus of signal flow diagrams. I: Linear relations on streams. ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

Cites Work

• Unnamed Item
• Unnamed Item
• Higher-dimensional word problems with applications to equational logic
• A formal approach to designing delay-insensitive circuits
• Syntactic control of concurrency
• Towards an algebraic theory of Boolean circuits.
• On the Hopf algebraic origin of Wick normal ordering
• Categorical quantum mechanics
• Geometry of Synthesis II: From Games to Delay-Insensitive Circuits
• Geometry of synthesis
• Geometry of synthesis III

This page was built for publication: Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits