A new algorithm for partitioned symbolic reachability analysis
From MaRDI portal
Publication:4982091
Recommendations
Cites work
- scientific article; zbMATH DE number 1538049 (Why is no real title available?)
- scientific article; zbMATH DE number 1890701 (Why is no real title available?)
- scientific article; zbMATH DE number 2090710 (Why is no real title available?)
- scientific article; zbMATH DE number 1390338 (Why is no real title available?)
- Binary Decision Diagrams
- Graph-Based Algorithms for Boolean Function Manipulation
- Multi-terminal binary decision diagrams
- Pascal's prism
Cited in
(5)- scientific article; zbMATH DE number 1979555 (Why is no real title available?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Formal Methods in Computer-Aided Design
- Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
- Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration
This page was built for publication: A new algorithm for partitioned symbolic reachability analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982091)