Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/95735
Title: | The synthesis of time optimal supervisors by using heaps-of-pieces | Authors: | Su, Rong. van Schuppen, J. H. Rooda, J. E. |
Keywords: | DRNTU::Engineering::Electrical and electronic engineering | Issue Date: | 2011 | Source: | Su, R., van Schuppen, J. H., & Rooda, J. E. (2012). The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces. IEEE Transactions on Automatic Control, 57(1), 105-118. | Series/Report no.: | IEEE transactions on automatic control | Abstract: | In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety requirements but also achieves a certain time optimal performance such as maximum throughput. In this paper, we first present a minimum-makespan supervisor synthesis problem. Then we show that the problem can be solved by a terminable algorithm, where the execution time of each string is computable by the theory of heaps-of-pieces. We also provide a timed supervisory control map that can implement the synthesized minimum-makespan sublanguage. | URI: | https://hdl.handle.net/10356/95735 http://hdl.handle.net/10220/11239 |
DOI: | 10.1109/TAC.2011.2157391 | Schools: | School of Electrical and Electronic Engineering | Rights: | © 2011 IEEE. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | EEE Journal Articles |
SCOPUSTM
Citations
5
69
Updated on Mar 22, 2024
Web of ScienceTM
Citations
5
59
Updated on Oct 26, 2023
Page view(s) 50
528
Updated on Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.