Article

Free access

A generalized state assignment theory for transformation on signal transition graphs

Authors:

Peter Vanbekbergen,

Bill Lin,

Gert Goosens,

Hugo De ManAuthors Info & Claims

ICCAD '92: Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design

Pages 112 - 117

Published: 08 November 1992 Publication History

PDF eReader

References

[1]

T.A. Ghu. Synthesis of Self-timed VLS1 Circuits from Graph-theoretic Specifications. PhD thesis, MIT, June 1987.

Google Scholar

[2]

J. E. Hopcroft and J. D. Ullman. Introduction to automata theory, languages and computation. In Addison-Wesley. Rending, Mass., 1979.

Digital Library

Google Scholar

[3]

T. Larrabee. Test pattern generation using boolean satisfiability. IEEE Transactions on GAD, 11(1), January 1992.

Google Scholar

[4]

L. Lavagno, K. Keutzer, and A. Sangiovanni- Vincentelli. Algorithms for synthesis of hazard-free asynchronous circuits. In Proceedings of the Design Automation Conference, June 1991.

Digital Library

Google Scholar

[5]

L. Lavagno, C. W. Moon, R. K. Brayton, and A. Sangiovanni-Vincentelli. Solving the state assignment problem for signal transition graphs. In Proceedings of the Design Automation Conference, June 1992.

Digital Library

Google Scholar

[6]

T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the 1EEE, pages 541-580, April 1989.

Google Scholar

[7]

J. H. Tracey. Internal state assignments for asynchronous sequential machines. 1EEE Transactions on Electronic Computers, EC-15(4):551-560, August 1966.

Crossref

Google Scholar

[8]

S. H. Unger. Asynchronous Sequential Switching Circuits. Wiley interscience, 1969.

Digital Library

Google Scholar

[9]

P. Vanbekbergen. Optimized synthesis of asynchronous control circuits from graph-theoretic specifications. In Proceedings of the International Conference on Computer-Aided Design, pages 184-187, November 1990.

Crossref

Google Scholar

[10]

P. Vanbekbergen. Synthesis of Asynchronous Control Circuits Jrom Graph. Theoretic specifications. PhD thesis, Catholic University of Leuven, ESAT, 1992. To appear.

Google Scholar

[11]

V.I. Varshavsky, M.A. Kishinevsky, A.Y. Kondratyev, L.Y Rosenblum, and A.R. Taubin. Models for specification and analysis of processes in asynchronous circuits. Soviet Journal of Computer and Systems Sciences, July 1989.

Google Scholar

[12]

A. V. Yakovlev and A. Petrov. Petri nets and p~rMlel bus controller design. In international Conference on Application and Theory of Petri Nets, Paris, France, June 1990.

Google Scholar

Cited By

View all

Singh MNowick S(2007)The design of high-performance dynamic asynchronous pipelinesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2007.90220615:11(1270-1283)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1109/TVLSI.2007.902206
Lin Bde Jong GKolks TPreas B(1995)Hierarchical optimization of asynchronous circuitsProceedings of the 32nd annual ACM/IEEE Design Automation Conference10.1145/217474.217616(712-717)Online publication date: 1-Jan-1995
https://dl.acm.org/doi/10.1145/217474.217616
Puri RGu JPaulin P(1994)A divide-and-conquer approach for asynchronous interface synthesisProceedings of the 7th international symposium on High-level synthesis10.5555/254208.254252(118-125)Online publication date: 20-May-1994
https://dl.acm.org/doi/10.5555/254208.254252
Show More Cited By

Index Terms

A generalized state assignment theory for transformation on signal transition graphs
1. Applied computing
  1. Physical sciences and engineering
    1. Engineering
2. Hardware
  1. Emerging technologies
  2. Very large scale integration design

Recommendations

A generalized state assignment theory for transformations on signal transition graphs
Special issue: asynchronous circuit design for VLSI signal processing

In this article, we propose a global assignment theory forencoding state graph transformations. A constraint satisfaction framework is proposed that can guaranteenecessary and sufficient conditions for a state graph assignment to result in a transformed ...
Channel assignment problem and relaxed 2-distant coloring of graphs
Abstract
Let G be a simple graph. Suppose f is a mapping from V ( G ) to nonnegative integers. If, for any two adjacent vertices u and v of G, | f ( u ) − f ( v ) | ≥ 2, then f is called a 2-distant coloring of G. In this paper, we introduce a ...
Generalised Ramsey numbers for small graphs

The generalised Ramsey number R(G"1, G"2,..., G"k) is defined as the smallest integer n such that, if the edges of K"n, the complete graph on n vertices, are coloured using k colours C"1, C"2,..., C"k, then for some i(1@?i@?k) there is a subgraph G"i of ...

Comments

Information & Contributors

Information

Published In

ICCAD '92: Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design

November 1992

637 pages

ISBN:0897915402

Chairmen:
Louise Trevillyan
IBM Corp., Yorktown Heights, NY
,
Michael Lightner
Univ. of Colorado, Boulder

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 08 November 1992

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
205
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)6

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Singh MNowick S(2007)The design of high-performance dynamic asynchronous pipelinesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2007.90220615:11(1270-1283)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1109/TVLSI.2007.902206
Lin Bde Jong GKolks TPreas B(1995)Hierarchical optimization of asynchronous circuitsProceedings of the 32nd annual ACM/IEEE Design Automation Conference10.1145/217474.217616(712-717)Online publication date: 1-Jan-1995
https://dl.acm.org/doi/10.1145/217474.217616
Puri RGu JPaulin P(1994)A divide-and-conquer approach for asynchronous interface synthesisProceedings of the 7th international symposium on High-level synthesis10.5555/254208.254252(118-125)Online publication date: 20-May-1994
https://dl.acm.org/doi/10.5555/254208.254252
Vanbekbergen PGoossens GLin BMermet J(1994)Modeling and synthesis of timed asynchronous circuitsProceedings of the conference on European design automation10.5555/198174.198303(460-465)Online publication date: 23-Sep-1994
https://dl.acm.org/doi/10.5555/198174.198303
Lin BDevadas SJess JRudell R(1994)Synthesis of hazard-free multi-level logic under multiple-input changes from binary decision diagramsProceedings of the 1994 IEEE/ACM international conference on Computer-aided design10.5555/191326.191553(542-549)Online publication date: 6-Nov-1994
https://dl.acm.org/doi/10.5555/191326.191553
Lin BVercauteren SJess JRudell R(1994)Synthesis of concurrent system interface modules with automatic protocol conversion generationProceedings of the 1994 IEEE/ACM international conference on Computer-aided design10.5555/191326.191369(101-108)Online publication date: 6-Nov-1994
https://dl.acm.org/doi/10.5555/191326.191369
Kondratyev AKishinevsky MLin BVanbekbergen PYakovlev ALorenzetti M(1994)Basic gate implementation of speed-independent circuitsProceedings of the 31st annual Design Automation Conference10.1145/196244.196275(56-62)Online publication date: 6-Jun-1994
https://dl.acm.org/doi/10.1145/196244.196275
Pastor ECortadella JLightner MJess J(1993)Polynomial algorithms for the synthesis for hazard-free circuits from signal transition graphsProceedings of the 1993 IEEE/ACM international conference on Computer-aided design10.5555/259794.259837(250-254)Online publication date: 7-Nov-1993
https://dl.acm.org/doi/10.5555/259794.259837
Moon CBrayton RDunlop A(1993)Elimination of dynamic hazards by factoringProceedings of the 30th international Design Automation Conference10.1145/157485.164551(7-13)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164551

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A generalized state assignment theory for transformations on signal transition graphs

Channel assignment problem and relaxed 2-distant coloring of graphs

Generalised Ramsey numbers for small graphs

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A generalized state assignment theory for transformations on signal transition graphs

Channel assignment problem and relaxed 2-distant coloring of graphs

Generalised Ramsey numbers for small graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations