Results 151 to 160 of about 240,562 (189)
Some of the next articles are maybe not open access.
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.
Oortwijn, Wytse +2 more
openaire +2 more sources
OBDDs — Ordered Binary Decision Diagrams
1998In this chapter, we introduce the representation type of ordered binary decision diagrams, called OBDDs for short. Although the underlying model of decision diagrams (or synonymously branching programs) was already studied by Lee and Akers in the 1950s and 1970s, these representations have not been used in serious applications for a long time. In 1986,
Christoph Meinel, Thorsten Theobald
openaire +1 more source
Binary decision diagrams and integer programming
2007In dieser Arbeit zeigen wir, wie Binary Decision Diagrams (BDDs) als ein mächtiges Werkzeug für die 0/1 Ganzzahlige Programmierung (0/1 IP) und zugehörige polyedrische Probleme eingesetzt werden können. Wir entwickeln einen output-sensitiven Algorithmus zum Bauen eines Threshold BDDs, der die zulässigen 0/1 Lösungen einer linearen Ungleichung darstellt,
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
Synthesis for Testability: Binary Decision Diagrams
1992We investigate the testability properties of Boolean circuits derived from (Reduced Ordered) Binary Decision Diagrams. It is shown that BDD-cirucits (or at least) BDD-like circuits are easily testable with respect to different fault models (cellular, stuck-at and path delay fault model).
openaire +1 more source
Automata and Binary Decision Diagrams
1999We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.
Jean-Francis Michon +1 more
openaire +1 more source
Propositional Logic: Binary Decision Diagrams
2012The problem of deciding the satisfiability of a formula in propositional logic has turned out to have many important applications in computer science. This chapter and the next one present two widely used approaches for computing with formulas in propositional logic.
openaire +1 more source