Results 11 to 20 of about 97,350 (281)
Compressing Binary Decision Diagrams
, 2008 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 ...
Hansen, Esben Rune +2 more
core +3 more sources
Equational Binary Decision Diagrams [PDF]
, 2007 We allow equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of reduced ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQOBDDs satisfiability and tautology checking can be done in constant time.
Groote, J.F., Pol, van de, J.C.
openaire +3 more sources
Symbolic BDD and ADD Algorithms for Energy Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Energy games, which model quantitative consumption of a limited resource, e.g., time or energy, play a central role in quantitative models for reactive systems.
Shahar Maoz +2 more
doaj +1 more source
On the Error Resilience of Ordered Binary Decision Diagrams [PDF]
, 2014 Ordered Binary Decision Diagrams (OBDDs) are a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthesis, program verification, data mining, bioinformatics, and data protection) for representing and ...
Bernasconi, Anna +2 more
core +3 more sources
Using Extended Logical Primitives for Efficient BDD Building
Mathematics, 2020 Binary Decision Diagrams (BDDs) have been used to represent logic models in a variety of research contexts, such as software product lines, circuit testing, and plasma confinement, among others.
David Fernandez-Amoros +3 more
doaj +1 more source
MALL proof equivalence is Logspace-complete, via binary decision diagrams [PDF]
, 2015 Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets:
Bagnol, Marc
core +3 more sources
Partial binary decision diagrams [PDF]
Proceedings of the Thirty-Fourth Southeastern Symposium on System Theory (Cat. No.02EX540), 2003 Decision diagrams provide compact representations for discrete functions. There are some functions for which binary decision diagrams reach exponential size. Presented here is a method of representing Boolean functions as multiple partial decision diagrams.
W.J. Townsend, M.A. Thornton
openaire +1 more source
Binary Decision Diagrams: from Tree Compaction to Sampling
, 2020 Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique ...
A Genitrini +9 more
core +1 more source
Energies, 2019 The wind energy industry is expanding in order to be able to meet the current and future energy demand, and is supported by governments in that renewable energy investment has been made.
Fausto Pedro García Márquez +2 more
doaj +1 more source
Communications, 2014 Reliability is the important characteristic of systems. Most of the systems consist of more than one component. Moreover, modern systems are very complex and they include a lot of components. Therefore, effective methods have to be developed for analysis
Jozef Kostolny +2 more
doaj +1 more source