Book Chapter10.1007/978-1-4615-0817-5_11
Ordered binary decision diagrams
Randal E. Bryant,Christoph Meinel +1 more
- 01 Nov 2001
- pp 285-307
38
TL;DR: OBDDs are the state-of-the-art data structure for representing switching functions in various branches of electronic design automation.
read more
Abstract: Ordered Binary Decision Diagrams (OBDDs) play a key role in the automated synthesis and formal verification of digital systems. They are the state-of-the-art data structure for representing switching functions in various branches of electronic design automation. In the following we discuss the properties of this data structure, characterize its algorithmic behavior, and describe some prominent applications.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Inductive Logic Programming: 23rd International Conference, ILP 2013, Rio de Janeiro, Brazil, August 28-30, 2013, Revised Selected Papers
Gerson Zaverucha,Vítor Santos Costa,Aline Paes +2 more
- 24 Sep 2014
Abstract: This book constitutes the thoroughly refereed post-proceedings of the 23rd International Conference on Inductive Logic Programming, ILP 2013, held in Rio de Janeiro, Brazil, in August 2013. The 9 revised extended papers were carefully reviewed and selected from 42 submissions. The conference now focuses on all aspects of learning in logic, multi-relational learning and data mining, statistical relational learning, graph and tree mining, relational reinforcement learning, and other forms of learning from structured data.
TLSim and EVC: a term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories
TL;DR: A tool flow for high-level design and formal verification of embedded processors that includes the term-level symbolic simulator TLSim, the decision procedure EVC (Equality Validity Checker) for the logic of Equality with Uninterpreted Functions and Memories, and any SAT solver.
Research on a seismic connectivity reliability model of power systems based on the quasi-Monte Carlo method
Xiaohang Liu,Xiaohang Liu,Shansuo Zheng,Shansuo Zheng,Xinxia Wu,Xinxia Wu,Chen Dianxin,Chen Dianxin,He Jinchuan +8 more
TL;DR: In this article, a triangle algorithm that can reduce the amount of computation in solving connectivity matrix is proposed to establish a seismic connectivity reliability calculation model with low-discrepancy sequence sampling.
31
Connectivity reliability and topological controllability of infrastructure networks: A comparative assessment
TL;DR: A comparative study of the connectivity reliability and topological controllability of infrastructure systems in terms of topology, robustness, and node importance reveals that a dense and homogeneous network topology is better to satisfy CR and TC requirements, than more common sparse and heterogeneous networks when node attributes are generic.
27
A BDD-Based Algorithm for Learning from Interpretation Transition
Tony Ribeiro,Katsumi Inoue,Katsumi Inoue,Chiaki Sakama +3 more
- 28 Aug 2013
TL;DR: This paper proposes a new learning algorithm of this method utilizing an efficient data structure inspired from Ordered Binary Decision Diagrams and shows empirically that using this representation the authors can perform the same learning task faster with less memory space.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
Related Papers (5)
Soha Hassoun,Tsutomu Sasao +1 more
- 01 Jul 2013
Bernd Becker,Rolf Drechsler,Michael Theobald +2 more
- 10 Jul 1995
Rolf Drechsler,Bernd Becker +1 more
- 02 Oct 1995