Affordable Access

Boolean Expression Diagrams

Academic Press
Publication Date
  • This Paper Presents A New Data Structure Called Boolean Expression Diagrams (Beds) For Representing
  • Beds Are A Generalization Of Binary Decision Diagrams (Bdds) Which Can Represent Any Boolean Circuit
  • Two Algorithms Are Described For Transforming A Bed Into A Reduced Ordered Bdd
  • One Is A Generalized Version Of The Bdd Apply-Operator While The Other Can Exploit The Structural In
  • This Ability Is Demonstrated By Verifying That Two Different Circuit Implementations Of A 16-Bit Mul
  • Using Beds
  • This Verification Problem Is Solved Efficiently
  • While Using Standard Bdd Techniques This Problem Is Infeasible
  • Generally
  • Beds Are Useful In Applications
  • For Example Tautology Checking
  • Where The End-Result As A Reduced Ordered Bdd Is Small
  • Moreover
  • Using Operators For Substitution And Existential Quantification They Allow For The Verification Of L


Boolean Expression Diagrams - DTU Orbit (18/06/14) Boolean Expression Diagrams - DTU Orbit (18/06/14) Boolean Expression Diagrams Andersen, H. R. & Hulgaard, H. 15 Dec 2002 In : Information and Computation. 179, 2, p. 194-212 Publication: Research - peer-review › Journal article – Annual report year: 2002

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times