Asynchronous logic circuits and sheaf obstructions
From MaRDI portal
Abstract: This article exhibits a particular encoding of logic circuits into a sheaf formalism. The central result of this article is that there exists strictly more information available to a circuit designer in this setting than exists in static truth tables, but less than exists in event-level simulation. This information is related to the timing behavior of the logic circuits, and thereby provides a ``bridge between static logic analysis and detailed simulation.
Recommendations
Cites work
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- AN APPLICATION OF ALGEBRAIC TOPOLOGY TO NUMERICAL ANALYSIS: ON THE EXISTENCE OF A SOLUTION TO THE NETWORK PROBLEM
- An introduction to the -calculus.
- Asynchronous operators of sequential logic: Venjunction \& sequention. Digital circuit analysis and design
- Automatic Verification of Sequential Circuits Using Temporal Logic
- Compiling communicating processes into delay-insensitive VLSI circuits
- Correct-by-construction asynchronous implementation of modular synchronous specifications
- Formal proof -- theory and practice
- scientific article; zbMATH DE number 992305 (Why is no real title available?)
- scientific article; zbMATH DE number 795666 (Why is no real title available?)
- scientific article; zbMATH DE number 3262067 (Why is no real title available?)
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- Logic Synthesis for Asynchronous Controllers and Interfaces
- On several geometric aspects of nonlinear networks
- On the delay-sensitivity of gate networks
- On the mathematical foundations of electrical circuit theory
- Unicursal resistive networks
Cited in
(4)
This page was built for publication: Asynchronous logic circuits and sheaf obstructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179025)