Checking signal transition graph implementability by symbolic BDD traversal
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper defines conditions for a Signal Transition Graph to be implemented by an asynchronous circuit. A hierarchy of the implementability classes is presented. Our main concern is the implementability of the specification under the restricted input-output interface between the design and the environment, i.e., when no additional interface signals are allowed to be added to the design. We develop algorithms and present experimental results of using BDD-traversal for checking STG implementability. These results demonstrate efficiency of the symbolic approach and show a way of improving existing tools for STG-based asynchronous circuit design.Keywords
This publication has 7 references indexed in Scilit:
- Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Verification of the speed-independent circuits by STG unfoldingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Characterizing speed-independence of high-level designsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Algorithms for Synthesis and Testing of Asynchronous CircuitsPublished by Springer Nature ,1993
- Optimized synthesis of asynchronous control circuits from graph-theoretic specificationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989