Abstract
This paper describes algorithms and techniques underlying a CAD system called CLASS (Cirrus Logic Asynchronous Synthesis 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 to State Graphs. Newly developed hazard-free synthesis techniques from State Graphs will be described. An efficient two-level hierarchical verification technique based on State Graph Contraction and Dill's verifier is used to verify the logic implementations against the state graph.
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.
