Adiar Binary Decision Diagrams in External Memory

نویسندگان

چکیده

We follow up on the idea of Lars Arge to rephrase Reduce and Apply procedures Binary Decision Diagrams (BDDs) as iterative I/O-efficient algorithms. identify multiple avenues simplify improve performance his proposed Furthermore, we extend technique other common BDD operations, many which are not derivable using operations alone, provide asymptotic improvements for that can be derived Apply. These algorithms implemented in a new package, named Adiar. see very promising results when comparing Adiar with conventional packages use recursive depth-first For instances larger than 8.2 GiB, our algorithms, parts disk, 1.47 3.69 times slower compared CUDD Sylvan, exclusively main memory. Yet, techniques able obtain this at fraction memory needed by function. manipulate BDDs outgrow so surpass limits packages.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equational Binary Decision Diagrams Equational Binary Decision Diagrams

We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...

متن کامل

Compressing Binary Decision Diagrams

The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparis...

متن کامل

Equational Binary Decision Diagrams

We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...

متن کامل

Binary Decision Diagrams

A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table requires space Ω(2n) to represent. In this lecture we introduce a data structure called a binary decision diagram which gives a representation that is potentially much more compact. We furthermore show how binary decision diagrams can be used to decide satisfia...

متن کامل

Binary Decision Diagrams

We review Binary Decision Diagrams presenting the properties and algorithms that are most relevant to their application to the verification of sequential systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-99527-0_16