By Topic

Automatic synthesis and verification of hazard-free control circuits from asynchronous finite state machine specifications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chu, T.-A. ; Cirrus Logic Inc., Fremont, CA, USA

The author describes algorithms and techniques underlying a CAD system for automatic synthesis and verification of control circuits based on asynchronous finite state machine (AFSM) specifications. AFSM specifications are transformed into signal transition graphs, and then into state graphs. Techniques for hazard-free synthesis techniques from state graphs are described. An efficient two-level hierarchical technique based on state graph contraction and D. Dill's verifier (ACM Distinguished Dissertation Series) is used to verify the logic implementations against the state graph. A CAD prototype called CLASS, (Cirrus Logic Asynchronous Synthesis System) has been used to successfully synthesize and verify the HP Labs benchmark and various other real applications

Published in:

Computer Design: VLSI in Computers and Processors, 1992. ICCD '92. Proceedings, IEEE 1992 International Conference on

Date of Conference:

11-14 Oct 1992