Skip to main content

Synthesis and Verification of Finite State Machines

  • Chapter
Logic Synthesis and Verification Algorithms
  • 1299 Accesses

Summary

In this chapter we have discussed in detail the method due to Rho, et al, [228] for minimizing incompletely specified FSMs. This method is applicable in the most significant FSM synthesis scenario, in which the FSM is initially designed and simulated in some high level language, and then synthesized down to the RTL (Register Transfer Level) and logic levels of abstraction, which naturally leads to incomplete specification.

We further introduced an approach to FSM encoding that is used in the most widely available CAD tools. The basic notion is that of anticipating, in the encoding step, the the logic minimization operations that will likely be applied at later steps in the design cycle.

We concluded with a brief treatment of Hartmanis and Stearns’ elegant work on encoding via partitions with the substitution property.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Kluwer Academic Publishers

About this chapter

Cite this chapter

(2002). Synthesis and Verification of Finite State Machines. In: Logic Synthesis and Verification Algorithms. Springer, Boston, MA. https://doi.org/10.1007/0-306-47592-8_8

Download citation

  • DOI: https://doi.org/10.1007/0-306-47592-8_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-9746-5

  • Online ISBN: 978-0-306-47592-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics