Solving the state assignment problem for signal transition graphs
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors propose a novel framework to solve the state assignment problem arising from the signal transition graph (STG) representation of an asynchronous circuit. They first solve the STG state assignment problem by minimizing the number of states in the corresponding finite-state machine (FSM) and by using a critical race-free state assignment technique. State signal transitions may be added to the original STG. A lower bound on the number of signals necessary to implement the STG is given. The technique significantly increases the applicability of STGs for specifying asynchronous circuits.Keywords
This publication has 5 references indexed in Scilit:
- Formal method for self-timed designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimized synthesis of asynchronous control circuits from graph-theoretic specificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms for synthesis of hazard-free asynchronous circuitsPublished by Association for Computing Machinery (ACM) ,1991
- A framework for satisfying input and output encoding constraintsPublished by Association for Computing Machinery (ACM) ,1991
- Internal State Assignments for Asynchronous Sequential MachinesIEEE Transactions on Electronic Computers, 1966