Diagrammatic Semantics for Digital Circuits.
From MaRDI portal
Abstract: We introduce a general diagrammatic theory of digital circuits, based on connections between monoidal categories and graph rewriting. The main achievement of the paper is conceptual, filling a foundational gap in reasoning syntactically and symbolically about a large class of digital circuits (discrete values, discrete delays, feedback). This complements the dominant approach to circuit modelling, which relies on simulation. The main advantage of our symbolic approach is the enabling of automated reasoning about abstract circuits, with a potentially interesting new application to partial evaluation of digital circuits. Relative to the recent interest and activity in categorical and diagrammatic methods, our work makes several new contributions. The most important is establishing that categories of digital circuits are Cartesian and admit, in the presence of feedback expressive iteration axioms. The second is producing a general yet simple graph-rewrite framework for reasoning about such categories in which the rewrite rules are computationally efficient, opening the way for practical applications.
Recommendations
- Semantics of digital circuits
- System Semantics and formal circuit description
- Circuit representation for design and diagnosis of electronic systems
- scientific article; zbMATH DE number 1852918
- Representational and denotational semantics of digital systems
- Symbolic analysis of analog and digital circuits
- scientific article; zbMATH DE number 1787154
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
Cited in
(25)- Circuit representation for design and diagnosis of electronic systems
- scientific article; zbMATH DE number 3852958 (Why is no real title available?)
- A structural and nominal syntax for diagrams
- Introduction to linear bicategories
- scientific article; zbMATH DE number 1499084 (Why is no real title available?)
- scientific article; zbMATH DE number 1522999 (Why is no real title available?)
- Props in Network Theory
- scientific article; zbMATH DE number 3993456 (Why is no real title available?)
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
- scientific article; zbMATH DE number 7456059 (Why is no real title available?)
- scientific article; zbMATH DE number 7471699 (Why is no real title available?)
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Graphical Conjunctive Queries.
- Monoidal Width
- Monoidal Width: Capturing Rank Width
- String Diagrams for Layered Explanations
- String diagrammatic electrical circuit theory
- Categorical foundations of gradient-based learning
- Graphical piecewise-linear algebra
- String diagrams for strictification and coherence
- Operads for complex system design specification, analysis and synthesis
- Differentiable causal computations via delayed trace (extended version)
- Rewriting for symmetric monoidal categories with commutative (co)monoid structure
- Compositional control-driven Boolean circuits
- A complete theory of sequential digital circuits: denotational, operational and algebraic semantics
This page was built for publication: Diagrammatic Semantics for Digital Circuits.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111192)
