State machine abstraction from circuit layouts using BDD's: applications in verification and synthesis

Abstract

This paper discusses a formal technique for abstracting a finite state machine (FSM) from a transistor netlist, given information relating to clock signals and clocking methodology. The abstracted FSM is represented as a transition relation using Binary Decision Diagrams (BDD ‘s) and then converted into a synchronous sequential network. Both the relational… (More)

Topics

6 Figures and Tables

Slides referencing similar topics