A Method for Connected Row Set Assignment of Asynchronous Sequential Machines

Abstract

This paper presents a method for the state assignment of asynchronous sequential machines from graph theoretic point of view. In 1972 Saucier [1] developed an algorithm for deriving a shared row assignment of a given flow table using graph theoretic approach. Here, we propose a technique for deriving a connected row set assignment utilizing bipartite property of a graph. Emphasis is placed on achieving an assignment with minimal memory requirements or requiring one or two additional variables.

Indexing terms:

• Boolean graph
• flow table
• layer representation of a graph
• bipartite property