Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
