Verification of asynchronous circuits by BDD-based model checking of Petri nets
From MaRDI portal
Publication:5096372
Recommendations
Cites work
- Compiling communicating processes into delay-insensitive VLSI circuits
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 3991418 (Why is no real title available?)
- scientific article; zbMATH DE number 4050939 (Why is no real title available?)
- scientific article; zbMATH DE number 711039 (Why is no real title available?)
Cited in
(14)- Rewriting semantics of production rule sets
- Structure-based deadlock checking of asynchronous circuits
- scientific article; zbMATH DE number 1629966 (Why is no real title available?)
- scientific article; zbMATH DE number 1696445 (Why is no real title available?)
- scientific article; zbMATH DE number 5814792 (Why is no real title available?)
- scientific article; zbMATH DE number 6831517 (Why is no real title available?)
- Hierarchical Set Decision Diagrams and Automatic Saturation
- scientific article; zbMATH DE number 4049572 (Why is no real title available?)
- scientific article; zbMATH DE number 1303725 (Why is no real title available?)
- Modelling, analysis and synthesis of asynchronous control circuits using Petri nets
- High level synthesis of synchronous parallel controllers
- On process-algebraic verification of asynchronous circuits
- Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams
- A decision diagram operation for reachability
This page was built for publication: Verification of asynchronous circuits by BDD-based model checking of Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096372)