Skip to main content

Permissible Behaviors in a Network of FSMs

  • Chapter
Synthesis of Finite State Machines

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.

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 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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A. (1997). Permissible Behaviors in a Network of FSMs. In: Synthesis of Finite State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2622-0_6

Download citation

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

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5170-0

  • Online ISBN: 978-1-4757-2622-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics