Results 11 to 20 of about 11,440 (300)
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 +2 more sources
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 in many cases reduce the size of the BDD to 1-2 bits per node.
Hansen, Esben Rune +2 more
openaire +3 more sources
Learning ordered binary decision diagrams
, 1995 We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output ...
Gavaldà Mestre, Ricard +1 more
core +5 more sources
Ordered Binary Decision Diagrams as Knowledge-Bases
Artificial Intelligence, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takashi Horiyama, Toshihide Ibaraki
core +4 more sources
Lattice-Valued Binary Decision Diagrams [PDF]
, 2010 This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functions of the form θ : 2P → L, where P is a finite set of Boolean propositions and L is a finite distributive lattice.
Geeraerts, Gilles +4 more
openaire +3 more sources
Symbolic Magnifying Lens Abstraction in Markov Decision Processes [PDF]
, 2008 In this paper, we combine abstraction-refinement and symbolic techniques to fight the state-space explosion problem when model checking Markov decision processes (MDPs).
Luca de Alfaro +7 more
core +1 more source
SAT-Based Learning of Compact Binary Decision Diagrams for Classification [PDF]
, 2023 Decision trees are a popular classification model in machine learning due to their interpretability and performance. However, the number of splits in decision trees grow exponentially with their depth which can incur a higher computational cost, increase
Shati, Pouya +2 more
core +1 more source
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
Binary Decision Diagrams by Shared Rewriting [PDF]
, 2000 In this paper we propose a uniform description of basic BDD theory and algorithms by means of term rewriting. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical forms can be obtained. Various reduction strategies give rise to different algorithms.
Pol, J. van de, Zantema, H.
openaire +4 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