A rewriting approach to binary decision diagrams
From MaRDI portal
Publication:1349250
DOI10.1016/S1567-8326(01)00013-3zbMath1015.68086WikidataQ62047505 ScholiaQ62047505MaRDI QIDQ1349250
Publication date: 21 May 2002
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
Resolution and binary decision diagrams cannot simulate each other polynomially, Zero, successor and equality in BDDs, Decomposing probabilistic lambda calculi, An efficient relational deductive system for propositional non-classical logics
Uses Software
Cites Work
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
- Branching Programs and Binary Decision Diagrams
- Handbook of Graph Grammars and Computing by Graph Transformation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item