Gu C, Wang X, Li Z (2019)
Publication Type: Journal article
Publication year: 2019
Book Volume: 16
Pages Range: 984-997
Journal Issue: 2
DOI: 10.1109/TASE.2018.2880178
Supervisory control theory (SCT) of a discrete-event system (DES) is well developed to find its maximally permissive supervisor. As an extension of SCT, a new framework, state-tree structures (STS), has been deployed to manage the state explosion problem of SCT. The supervisory control with partial observation is investigated in SCT, of which the state explosion issue remains to be explored. This paper dwells upon an approach to the synthesis of supervisory control with partial observation in the normal STS framework, requiring that the conjunction of any two projected subpredicates should be false. First, following the definition of the observability based on STS, it is proven that there does not exist the supremal observable subpredicate. Second, we construct a subclass of observable subpredicates of a given predicate (obtained as a specification) on the basis of normal STS. Third, a largest element is proven to exist in the subclass, and thus a weakly controllable, coreachable, and observable subpredicate is computed to solve the supervisory control problem of the normal STS by an iterative algorithm. An illustrative example with state size over 109 is given to show that the proposed algorithm based on STS is superior to the approach based on SCT, which leads to the program crashes in SCT.
APA:
Gu, C., Wang, X., & Li, Z. (2019). Synthesis of Supervisory Control With Partial Observation on Normal State-Tree Structures. IEEE Transactions on Automation Science and Engineering, 16(2), 984-997. https://doi.org/10.1109/TASE.2018.2880178
MLA:
Gu, Chan, Xi Wang, and Zhiwu Li. "Synthesis of Supervisory Control With Partial Observation on Normal State-Tree Structures." IEEE Transactions on Automation Science and Engineering 16.2 (2019): 984-997.
BibTeX: Download