Autonomous Clocks in Sequential Machines

Research output: Contribution to journalLetter

3 Citations (Scopus)

Abstract

A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

Original languageEnglish (US)
Pages (from-to)467-472
Number of pages6
JournalIEEE Transactions on Electronic Computers
VolumeEC-14
Issue number3
DOIs
StatePublished - 1965
Externally publishedYes

Fingerprint

Sequential machines
Clocks
Partition
State Machine
Connection Matrix
Table
Assignment
Internal
Necessary Conditions
Sufficient Conditions
Form

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Software
  • Theoretical Computer Science

Cite this

Autonomous Clocks in Sequential Machines. / Yau, Sik-Sang.

In: IEEE Transactions on Electronic Computers, Vol. EC-14, No. 3, 1965, p. 467-472.

Research output: Contribution to journalLetter

@article{c0a4d3173e0542b2988a698b2d624973,
title = "Autonomous Clocks in Sequential Machines",
abstract = "A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT",
author = "Sik-Sang Yau",
year = "1965",
doi = "10.1109/PGEC.1965.264156",
language = "English (US)",
volume = "EC-14",
pages = "467--472",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - Autonomous Clocks in Sequential Machines

AU - Yau, Sik-Sang

PY - 1965

Y1 - 1965

N2 - A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

AB - A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

UR - http://www.scopus.com/inward/record.url?scp=84931934751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84931934751&partnerID=8YFLogxK

U2 - 10.1109/PGEC.1965.264156

DO - 10.1109/PGEC.1965.264156

M3 - Letter

AN - SCOPUS:84931934751

VL - EC-14

SP - 467

EP - 472

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 3

ER -