Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Handbook of logic in computer science (vol. 2)
Handbook of graph grammars and computing by graph transformation
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Binary decision diagrams by shared rewriting
Binary decision diagrams by shared rewriting
Equational binary decision diagrams
Equational binary decision diagrams
Automatic verification of a model checker by reflection
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
In this paper we propose a uniform description of basic BDD theory and algorithms by means of term rewriting. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical forms can be obtained. Various reduction strategies give rise to different algorithms. A layerwise strategy is proposed having the same time complexity as the traditional apply-algorithm, and the lazy strategy is studied, which resembles the existing up-one-algorithm. We show that these algorithms have incomparable performance.