Abstract
The goal of this chapter is to provide a unified notational framework for the book, and to introduce key elements of a theory for functional synthesis of FSMs. First we define some useful classes of finite state machines (FSMs) and finite automata (FAs), and investigate their inter-relationship. We will show that a non-deterministic FSM (NDFSM) can be used to specify a set of behaviors. Then we will describe how different behaviors can be explored within an NDFSM specification. These concepts are central to exact algorithms for state minimization for FSMs. At the end of the chapter, the correctness of our state minimization algorithms will be proved for a class of FSMs called pseudo non-deterministic FSMs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights 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). Taxonomy and Theory of Behaviors. In: Synthesis of Finite State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2622-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2622-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5170-0
Online ISBN: 978-1-4757-2622-0
eBook Packages: Springer Book Archive