A rewriting approach to binary decision diagrams

DOI10.1016/S1567-8326(01)00013-3zbMath1015.68086OpenAlexW2135723187WikidataQ62047505 ScholiaQ62047505MaRDI QIDQ1349250

Hans Zantema, Jaco van de Pol

Publication date: 21 May 2002

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1567-8326(01)00013-3

zbMATH Keywords

binary decision diagrams

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Decomposing probabilistic lambda calculi ⋮ Resolution and binary decision diagrams cannot simulate each other polynomially ⋮ Zero, successor and equality in BDDs ⋮ An efficient relational deductive system for propositional non-classical logics

Uses Software

• ATERM

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

This page was built for publication: A rewriting approach to binary decision diagrams