2002Unpublished venueRequires access

Practical FSM analysis for Verilog

T.-H. Wang, T. Edsall

Open publisher page 7 citations

Abstract

The ability to analyze a finite state machine (fsm) has always been desired by hardware designers, since an un-analyzed fsm is clearly prone to design bugs. Unfortunately there are too many ways to represent (code) an fsm. It is almost impossible for a tool to identify all possible fsm coding styles. In our department, at Cisco, we have a standardized fsm coding style. The standard fsm coding style allows us to easily extract an fsm. The extracted fsm is then fed to various tools for analysis: fsm reachability property, fsm coverage, and automatic fsm bubble diagram drawing. We show our standard fsm coding style, how fsms are extracted, and a well known algorithm that is used to study the reachability property. Then we show how to monitor the fsm transition coverage and also introduce a tool to automatically draw an fsm bubble diagram from the extracted fsm.

About this research paper

What this paper is about

The ability to analyze a finite state machine (fsm) has always been desired by hardware designers, since an un-analyzed fsm is clearly prone to design bugs. Unfortunately there are too many ways to represent (code) an fsm. It is almost impossible for a tool to identify all possible fsm coding styles. In our department, at Cisco, we have a standardized fsm coding style. The standard fsm coding style allows us to easily extract an fsm. The extracted fsm is then fed to various tools for analysis: fsm reachability property, fsm coverage, and automatic fsm bubble diagram drawing. We show our standard fsm coding style, how fsms are extracted, and a well known algorithm that is used to study the reachability property. Then we show how to monitor the fsm transition coverage and also introduce a tool to automatically draw an fsm bubble diagram from the extracted fsm.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The ability to analyze a finite state machine (fsm) has always been desired by hardware designers, since an un-analyzed fsm is clearly prone to design bugs. Unfortunately there are too many ways to represent (code) an fsm. It is almost impossible for a tool to identify all possible fsm coding styles. In our department, at Cisco, we have a standardized fsm coding style. The standard fsm coding style allows us to easily extract an fsm. The extracted fsm is then fed to various tools for analysis: fsm reachability property, fsm coverage, and automatic fsm bubble diagram drawing. We show our standard fsm coding style, how fsms are extracted, and a well known algorithm that is used to study the reachability property. Then we show how to monitor the fsm transition coverage and also introduce a tool to automatically draw an fsm bubble diagram from the extracted fsm.

Key concepts: Computer science, Programming language

Related papers

Back to paper searchBrowse research topicsOriginal source
Practical FSM analysis for Verilog — Research Paper | ScholarLens