Structure-based deadlock checking of asynchronous circuits
From MaRDI portal
Publication:2637261
Recommendations
- Verification of asynchronous circuits by BDD-based model checking of Petri nets
- On process-algebraic verification of asynchronous circuits
- scientific article; zbMATH DE number 3861073
- Towards a unifying CSP approach to hierarchical verification of asynchronous hardware
- Hazard checking of timed asynchronous circuits revisited
Cites work
- A technique of state space search based on unfolding
- A Theory of Asynchronous Control Networks
- Balsa: An Asynchronous Hardware Synthesis Language
- Enumeration of the Elementary Circuits of a Directed Graph
- Graph-Based Algorithms for Boolean Function Manipulation
- Handshake Circuits
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 1759626 (Why is no real title available?)
Cited in
(2)
This page was built for publication: Structure-based deadlock checking of asynchronous circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637261)