Results 131 to 140 of about 9,112 (162)
Some of the next articles are maybe not open access.
2018
Binary decision diagrams provide a data structure for representing and manipulating Boolean functions in symbolic form. They have been especially effective as the algorithmic basis for symbolic model checkers. A binary decision diagram represents a Boolean function as a directed acyclic graph, corresponding to a compressed form of decision tree.
openaire +1 more source
Binary decision diagrams provide a data structure for representing and manipulating Boolean functions in symbolic form. They have been especially effective as the algorithmic basis for symbolic model checkers. A binary decision diagram represents a Boolean function as a directed acyclic graph, corresponding to a compressed form of decision tree.
openaire +1 more source
Distributed binary decision diagrams for symbolic reachability
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017Decision diagrams are used in symbolic verification to concisely represent state spaces. A crucial symbolic verification algorithm is reachability: systematically exploring all reachable system states. Although both parallel and distributed reachability algorithms exist, a combined solution is relatively unexplored.
Wytse Oortwijn +2 more
openaire +2 more sources
Binary superposed quantum decision diagrams
Quantum Information Processing, 2009The key theme of this work is the binary superposed decision diagrams or BSQDDs for short. The basic idea that lies behind BSQDDs is to represent a quantum superposition as a decision diagram where each node on each branch of a BSQDD corresponds to a gate.
openaire +1 more source
2011
A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These
openaire +1 more source
A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These
openaire +1 more source
On the Minimization of (Complete) Ordered Binary Decision Diagrams
Theory of Computing Systems, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the Width of Ordered Binary Decision Diagrams
2014Ordered binary decision diagrams (OBDDs) are a popular data structure for Boolean functions. One of its complexity measures is the width which has been investigated in several areas in computer science like machine learning, property testing, and the design and analysis of implicit graph algorithms.
openaire +1 more source
Evasiveness Through Binary Decision Diagrams
2023Aransay, Jesús [0000-0002-4079-8307] +2 more
openaire +2 more sources