A novel framework for solving the state assignment problem for event-based specifications

We propose a novel framework to solve the state assignment problem arising from the signal transition graph (STG) representation of an asynchronous circuit. We first establish a relation between STGs and finite state machines (FSMs). Then we solve the STG state assignment problem by minimizing the number of states in the corresponding 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. Our technique significantly increases the STG applicability as a specification for asynchronous circuits.

[1]  Fabio Somenzi,et al.  Exact and heuristic algorithms for the minimization of incompletely specified state machines , 1994, Proceedings of the European Conference on Design Automation..

[2]  Robert K. Brayton,et al.  Synthesis of hazard-free asynchronous circuits from graphical specifications , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[3]  Luciano Lavagno,et al.  Algorithms for synthesis of hazard-free asynchronous circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[4]  Tiziano Villa,et al.  A framework for satisfying input and output encoding constraints , 1991, 28th ACM/IEEE Design Automation Conference.

[5]  Sharad Malik,et al.  Combinational logic optimization techniques in sequential logic synthesis , 1991 .

[6]  Michael Kishinevsky,et al.  Formal method for self-timed design , 1991, Proceedings of the European Conference on Design Automation..

[7]  A. A. Petrov,et al.  Petri Nets and Parallel Bus Controller Design , 1991 .

[8]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[9]  Bill Lin,et al.  Minimization of symbolic relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[10]  Robert K. Brayton,et al.  Multi-Valued Decision Diagrams , 1990 .

[11]  A. J. Martin.  Formal program transformations for VLSI circuit synthesis , 1989 .

[12]  Tam-Anh Chu,et al.  Synthesis of self-timed VLSI circuits from graph-theoretic specifications , 1987 .

[13]  Alain J. Martin.  A Synthesis Method for Self-Timed VLSI Circuits , 1987 .

[14]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[15]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[16]  Stephen H. Unger,et al.  Asynchronous sequential switching circuits , 1969 .

[17]  James H. Tracey.  Internal State Assignments for Asynchronous Sequential Machines , 1966, IEEE Trans. Electron. Comput..