• DocumentCode
    958613
  • Title

    State Assignment of Asynchronous Sequential Machines Using Graph Techniques

  • Author

    Saucier, GabriÉle

  • Author_Institution
    Centre National de la Recherche Scientifique, Institute of Applied Mathematics, University of Grenoble, Grenoble, France.
  • Issue
    3
  • fYear
    1972
  • fDate
    3/1/1972 12:00:00 AM
  • Firstpage
    282
  • Lastpage
    288
  • Abstract
    A new algorithm for asynchronous machines is presented. The problem is formulated and solved in graph-theoretic terms. A graph-embedding algorithm in an n-cube developed in Sections I-III is used to establish the encoding method. The resulting critical race free encoding minimizes the dimensions of the internal variables and the transition times. This method should be especially interesting for large incomplete machines.
  • Keywords
    Encoding; Hypercubes; Asynchronous sequential machines; connected graph; embedding; encoding; hypercube;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1972.5008950
  • Filename
    5008950
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=958613