Skip to main content

Synthesis of Finite State Machines

Functional Optimization

  • Book
  • © 1997

Overview

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

  1. Preliminaries

  2. State Minimization of Incompletely Specified FSMs

  3. Flexibility in Networks of FSMs and Non-Deterministic FSMs

Keywords

About this book

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.

Authors and Affiliations

  • Intel Corporation, USA

    Timothy Kam

  • University of California, Berkeley, USA

    Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli

Bibliographic Information

  • Book Title: Synthesis of Finite State Machines

  • Book Subtitle: Functional Optimization

  • Authors: Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli

  • DOI: https://doi.org/10.1007/978-1-4757-2622-0

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1997

  • Hardcover ISBN: 978-0-7923-9842-4Published: 31 December 1996

  • Softcover ISBN: 978-1-4419-5170-0Published: 07 December 2010

  • eBook ISBN: 978-1-4757-2622-0Published: 09 March 2013

  • Edition Number: 1

  • Number of Pages: XIV, 282

  • Topics: Circuits and Systems, Electrical Engineering, Computer-Aided Engineering (CAD, CAE) and Design

Publish with us