Synthesis of Finite State Machines: Functional Optimization

ISBN-13: 9781441951700 / Angielski / Miękka / 2010 / 282 str.

Alberto L. Sangiovanni-Vincentelli; Timothy Kam; Tiziano Villa

Opis

Synthesis of Finite State Machines: Functional Optimization is one of two monographs devoted to the synthesis of Finite State Machines (FSMs). This volume addresses functional optimization, whereas the second addresses logic optimization. By functional optimization here we mean the body of techniques that:

• compute all permissible sequential functions for a given topology of interconnected FSMs, and
• select a best' sequential function out of the permissible ones.

The result is a symbolic description of the FSM representing the chosen sequential function. By logic optimization here we mean the steps that convert a symbolic description of an FSM into a hardware implementation, with the goal to optimize objectives like area, testability, performance and so on.
Synthesis of Finite State Machines: Functional Optimization is divided into three parts. The first part presents some preliminary definitions, theories and techniques related to the exploration of behaviors of FSMs. The second part presents an implicit algorithm for exact state minimization of incompletely specified finite state machines (ISFSMs), and an exhaustive presentation of explicit and implicit algorithms for the binate covering problem. The third part addresses the computation of permissible behaviors at a node of a network of FSMs and the related minimization problems of non-deterministic finite state machines (NDFSMs).
Key themes running through the book are the exploration of behaviors contained in a non-deterministic FSM (NDFSM), and the representation of combinatorial problems arising in FSM synthesis by means of Binary Decision Diagrams (BDDs).
Synthesis of Finite State Machines: Functional Optimization will be of interest to researchers and designers in logic synthesis, CAD and design automation.

Spis treści

Preface. Part I: Preliminaries. 1. Introduction. 2. Taxonomy and Theory of Behaviors. 3. Implicit Techniques. Part II: State Minimization of Incompletely Specified FSMS. 4. Compatible Generation. 5. Binate Covering. Part III: Flexibility in Networks of FSMS and Non-Deterministic FSMS. 6. Permissible Behaviors in a Network of FSMS. 7. State Minimization of Non-Deterministic FSMS. 8. State Minimization of PNDFSMS in Networks of FSMS. 9. Conclusions. References. Index.