An efficient heuristic procedure 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 STG's and finite state machines (FSM's). 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]  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.

[2]  Alexandre Yakovlev,et al.  Petri Nets and Parallel Bus Controller Design , 1991 .

[3]  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..

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

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

[6]  Tiziano Villa,et al.  A Fully Implicit Algorithm for Exact State Minimization , 1994, 31st Design Automation Conference.

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

[8]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Seiyang Yang,et al.  Optimum and suboptimum algorithms for input encoding and its relationship to logic minimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Hugo De Man,et al.  A Generalized State Assignment Theory for Transformations on Signal Transition Graphs. * Peter Vanbekbergenl Bill Linl Gert Goossensl Hugo De Man'T2 , 1992, ICCAD 1992.

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

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

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

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

[16]  Michael Kishinevsky,et al.  Concurrent hardware : the theory and practice of self-timed design , 1993 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[20]  Alexandre Yakovlev,et al.  Signal Graphs: From Self-Timed to Timed Ones , 1985, PNPM.

[21]  Fabrizio Luccio,et al.  A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..