Share This Author
CUDD: CU Decision Diagram Package Release 2.2.0
- F. Somenzi
- Computer Science
This tutorial jumps right in to the power of the DdManager without dragging you through the basics of basic data structure and management.
Algebraic decision diagrams and their applications
- R. I. Bahar, E. Frohm, F. Somenzi
- Computer ScienceProceedings of International Conference on…
- 7 November 1993
This paper presents a treatment founded in Boolean algebras and discusses algorithms and results in applications like matrix multiplication and shortest path algorithms, and outlines possible applications of ADD's to logic synthesis, formal verification, and testing of digital systems.
VIS: A System for Verification and Synthesis
VIS provides the capability to check the combinational equivalence of two designs and provides traditional verification in the form of a cycle-based simulator that uses BDD techniques.
Algebric Decision Diagrams and Their Applications
A treatment founded in Boolean algebras is presented and algorithms and results in several areas of application are discussed: Matrix multiplication, shortest path algorithms, and direct methods for numerical linear algebra.
Efficient Büchi Automata from LTL Formulae
We present an algorithm to generate small Buchi automata for LTL formulae. We describe a heuristic approach consisting of three phases: rewriting of the formula, an optimized translation procedure,…
Logic synthesis and verification algorithms
Logic Synthesis and Verification Algorithms blends mathematical foundations and algorithmic developments with circuit design issues to establish optimal design principles.
Exact and heuristic algorithms for the minimization of incompletely specified state machines
- June-Kyung Rho, G. Hachtel, F. Somenzi, R. Jacoby
- Computer ScienceProceedings of the European Conference on Design…
- 1 February 1994
The authors' results prove that exact state minimization is feasible for a large class of practical examples, certainly including most hand-designed FSM's, and argue that the true objective of state reduction should be reduction toward maximal encodability.
Markovian analysis of large finite state machines
- G. Hachtel, E. Macii, A. Pardo, F. Somenzi
- Computer Science, MathematicsIEEE Trans. Comput. Aided Des. Integr. Circuits…
- 1 December 1996
symbolic algorithms to compute the steady-state probabilities for very large finite state machines (up to 10/sup 27/ states) based on Algebraic Decision Diagrams (ADD's) and solve the corresponding Chapman-Kolmogorov equations.
Minimal Assignments for Bounded Model Checking
This work forms the extraction of a succinct counterexample as the problem of finding a minimal assignment that, together with the Boolean formula describing the model, implies an objective.
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
A taxonomy of techniques for fair cycle detection is presented and it is indicated that the Emerson-Lei procedure is the fastest, but other algorithms tend to generate shorter counter-examples.