1997 | OriginalPaper | Chapter
Permissible Behaviors in a Network of FSMs
Authors : Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
Published in: Synthesis of Finite State Machines
Publisher: Springer US
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 M1 is the FSM associated with the component to be optimized, M2 represents the behavior of the rest of the system, and M gives the specification. In a variant of the problem, the roles of M1 and M2 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 M2 in Figure 6.2-a, one can view x as feeding through M1 via a straight wire connection, as drawn in Figure 6.2-b; similarly the output z can be seen as passing through M1.