Abstract
A behavior is permissible at a node of an interconnection, say at M 1, if the system obtained by placing at that node a DFSM that represents the behavior works according to the original specification. Such a replacement is allowed if the composition is well-defined and the global behavior is the one expected. Unfortunately not any behavior contained in a PNDFSMs is permissible, i.e., it is valid candidate for implementation. The reason is that it may not yield a well-defined feedback composition. Watanabe proposed in [119] a sufficient condition in the form of acyclicity, for a behavior to be permissible. In the previous chapter, we have presented a comprehensive analysis of the conditions for the existence of a correct feedback composition, and described how to find all valid candidate behaviors. Since a valid candidate is preferred if it minimizes the number of states of the related FSM, here we will discuss the problem of the combined objective of finding a state-minimum and well-defined behavior.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). State Minimization of PNDFSMs in Networks of FSMs. In: Synthesis of Finite State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2622-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2622-0_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5170-0
Online ISBN: 978-1-4757-2622-0
eBook Packages: Springer Book Archive