Synthesis of Finite State Machines pp 177-218 | Cite as

# Permissible Behaviors in a Network of FSMs

## Abstract

A behavior is a set of input/output strings that can be produced or represented by a DFSM. An NDFSM will represent in general more than one behavior and more than one DFSM may represent the same behavior. Given a synchronous system of interacting FSMs and a specification, consider the problem of finding the complete set of permissible behaviors at a particular component of the system ^{1}. The problem is illustrated in Figure 6.1, where *M* _{1} is the FSM associated with the component to be optimized, *M* _{2} represents the behavior of the rest of the system, and *M* gives the specification. In a variant of the problem, the roles of *M* _{1} and *M* _{2} are inverted. Figures 6.2-(a) and 6.2-(b) show how the variant is reduced to the original problem. Although *x* is a direct input to *M* _{2} in Figure 6.2-a, one can view *x* as feeding through *M* _{1} via a straight wire connection, as drawn in Figure 6.2-b; similarly the output *z* can be seen as passing through *M* _{1}.

## Keywords

Model Match Unique Pair Product Machine Simulation Relation Dead State## Preview

Unable to display preview. Download preview PDF.