PORTA

VLSI - Design and Verification

Brief description:

Within the research field of BDD-based data structures for Boolean functions data structures, for the representation and computation of Boolean (i.e., 0-1-valued) functions have been designed and analyzed . The various practical applications of such data structures, e.g., in CAD systems for circuit design or in tools for the formal verification of communication protocols, sequential systems or electronic circuits made optimization and compactification of such structures a very worthwhile aim of research.

Research Topics

Optimizing OBDDsDevelopment of new global reordering strategies for minimization of OBDDs.

State encoding of sequential systems

Reduction concepts

More powerful BDD conceptsFree BDDs

Transformation concepts

Probabilistic Verification Using Parity-OBDDs

BDDs in applicationsAccelerating the Variable Reordering Process

OHO: OBDD-Heuristics Online: BDD-heuristic evaluation via WWW

Algorithms for BDDs with different variable orders

Partitioning of Transition Relations

People

List of our technical reports



PhD-Theses

Further Activities


Projects and Cooperation


[CS HOME] [DPT. HOME]
TCS+NA Research Page - webmaster - 30-May-2001