Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Implicit State Enumeration for FSMs with Datapaths
 

Summary: Implicit State Enumeration for FSMs
with Datapaths
James H. Kukula
Synopsys, Inc., Beaverton, OR
kukula@synopsys.com
Thomas R. Shiple Adnan Aziz \Lambda
Synopsys, Inc., Mountain View, CA
fshiple,adnang@synopsys.com
October 10, 1997
DAC '98 Submission
Abstract
We show how the classic BDD­based technique of implicit state enumeration for FSMs can
be generalized to an automata­based approach for implicit state enumeration of FSMs inter­
acting with datapaths of unbounded width. We present experimental results showing that our
automata representation of an unbounded width datapath can be 10x more compact than the
BDD representation of the corresponding 32­bit datapath.
1 Introduction
The BDD­based approach to functional verification of finite state systems has enjoyed some suc­
cess. This approach proceeds by first building BDDs for the next state functions and then using
implicit state enumeration to explore the state transition graph [12]. For systems with up to a

  

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences