Abstract
In this chapter, we study supervisor localization in a (dual) state-based setup, the state tree structures, which is known to be computationally efficient for monolithic supervisor synthesis. The efficiency is a result of modeling the state set hierarchically as a state tree which is then encoded by binary decision diagrams. First, we present preliminaries of the state tree structures and the state-based supervisory control. Then we develop a state tree structures based localization theory, and design a symbolic localization algorithm which is more efficient than the one in Chap. 2. This algorithm is demonstrated with a large-scale Cluster Tool system with state size of order \(10^{11}\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cai, K., Wonham, W.M. (2016). Localization Based on State Tree Structures. In: Supervisor Localization. Lecture Notes in Control and Information Sciences, vol 459. Springer, Cham. https://doi.org/10.1007/978-3-319-20496-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-20496-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20495-6
Online ISBN: 978-3-319-20496-3
eBook Packages: EngineeringEngineering (R0)