Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 15 of 15 for “"BDDs"”.
-
Symbolic techniques for VLSI test and diagnosis
… to the development of binary decision diagrams (BDDs), symbolic methods have become a practical means of handling the large sets encountered in these applications. In this thesis, several algorithms are presented which make use of BDDs to address problems in digital circuit testing and diagnosis.
-
Symbolic techniques for the performance analysis of generalised stochastic petri nets
Binary Decision Diagrams (BDDs) have been successfully used in sequential circuit theory, VLSI, and model checking. They form a highly memory efficient canonical representation of a Boolean function. In this dissertation, following on the success of BDDs in other fields, we investiage the …
-
Binäre Expression-Diagramme
… der populären binären Entscheidungs-Diagramme (BDDs) vor, die im Bereich der Logiksynthese und Verifikation des Rechnerentwurfs ihre Anwendung finden.
-
Practical verification of network planes
… is able to overcome some specific limitations of BDDs in the context of storing packet sets. We describe a set of benchmark traces for evaluating packet set data structures, and perform an experimental comparison of our proposed data structure with BDDs. The experiments show that we are able to …
-
Symbolic methods for testing digital circuits
… methods, realized by Boolean Decision Diagrams (BDDs), in the field of testing both combinational and synchronous sequential digital circuits at gate level. <br>Both major topics, fault simulation and automated test pattern generation (ATPG), have been examined, among others, like build-in …
-
Symbolic Approaches for Boolean Synthesis
… especially those using Binary Decision Diagrams (BDDs), an acyclic directed graph that maps the solutions for a boolean formula to its paths. Scalability challenges also rose as exponential memory blowups occurred in handling large-scale problems using BDDs, but it also becomes one of the most …
-
Improved Symbolic Model Checking of Real-Time Systems
… technique based on binary decision diagrams (BDDs) has been shown to be successful in handling the state space explosion. However, the application of BDD-based model checking requires knowledge of BDDs and is difficult for hierarchical systems. Moreover, the performance of BDD-based model …
-
Bdd-Based Engineering-Change Logic Synthesis
… forms, both of which are negative. We use BDDs for efficient computation of these expressions. Our algorithm is based on computing the maximum and minimum vectors of a BDD. Previous algorithms for this problem were based on inefficient enumeration of input vectors. The number of vectors to …
-
Applying binary decision diagrams to learn hidden Markov models
… it to operate on Binary Decision Diagrams (BDDs). The time and memory complexity of the algorithm is contingent on the size of the BDD, highlighting that the BDD’s size significantly depends on the variable ordering (a problem known to be NP-complete). Preliminary experiments showed that the …
-
Implementation of symbolic model checking for probabilistic systems
… data structure called binary decision diagrams (BDDs), we present an extension to the probabilistic case, using multi-terminal binary decision diagrams (MTBDDs). We demonstrate that MTBDDs can be used to perform probabilistic analysis of large, structured models with more than 7.5 billion states, …
-
Fast Discovery of Illegal State Cubes for Sequential Equivalence Checking
… state cubes and represent and compact them using BDDs. A BDD implementation was created to compact these illegal states more efficiently. Discussion is then done on the parameters of the BDD implementation design which can be used more efficiently given the situation. These illegal state cubes are …
-
Planen im Fluentkalkül mit binären Entscheidungsdiagrammen
… mit Binären Entscheidungsdiagrammen (BDDs) sinngemäß überträgt und für ein Fragment des Fluentkalkül erweitert. Damit können nun auch Planungsprobleme von Fluentkalkül-Planern gelöst werden, die der realisierten symbolischen Breitensuche besser zugänglich sind, als der bisher …
-
Solving Hybrid Boolean SAT by Continuous Optimization
… thesis presents to use binary decision diagrams (BDDs) to replace polynomials, which significantly accelerates the gradient computation both in theory and practice, meanwhile handling PB constraints. The thesis then proposes an approach for removing the requirement of supporting constraints from …
-
Policy Reasoning for Spectrum Agile Radios
… problem. BRESAP uses Binary Decision Diagrams (BDDs) to represent, analyze and process the policies. It uses a set of efficient graph-theoretic algorithms to merge these policies into a single meta-policy and compute opportunity constraints. Our policy reasoner has the capability to respond to …
-
Strategies for Performance and Quality Improvement of Hardware Verification and Synthesis Algorithms
According to Moore's law, Integrated Chips (IC) doubles its capacity every 18 months. This causes an exponential increase of the available area, and hence,the complexity of modern digital designs. This consistent enormous gross challenges different research areas in Electronic Design Automation …