Decomposition of Asynchronous Sequential Switching Circuits

Larry L Kinney

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

The problem of decomposing an asynchronous sequential circuit into the serial connection of two asynchronous sequential circuits is considered. Six types of serial connections are defined, and necessary and sufficient conditions are derived for making five of the six types of serial decomposition, while sufficient conditions are derived for the sixth. Systematic and constructive procedures are presented for making each of the decompositions. These results are an extension of the work of Hartmanis and Stearns [1] who used partitions for making decompositions of synchronous circuits. The procedures derived can also be used for making arbitrary loop-free decompositions of asynchronous circuits [7].

Original languageEnglish (US)
Pages (from-to)515-529
Number of pages15
JournalIEEE Transactions on Computers
VolumeC-19
Issue number6
DOIs
StatePublished - Jun 1970

Keywords

  • Asynchronous circuits
  • decomposition
  • partitions
  • sequential machines

Fingerprint Dive into the research topics of 'Decomposition of Asynchronous Sequential Switching Circuits'. Together they form a unique fingerprint.

  • Cite this