Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TAC.2011.2157391 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Automata,Supervisory control,Computational modeling,Clocks,Controllability,Electronic mail | Supervisor,Mathematical optimization,Job shop scheduling,Control theory,Supervisory control,Computer science,Automaton,Heap (data structure),Finite-state machine,Throughput,Sublanguage | Journal |
Volume | Issue | ISSN |
57 | 1 | 0018-9286 |
Citations | PageRank | References |
22 | 1.25 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rong Su | 1 | 318 | 45.41 |
| Jan H. van Schuppen | 2 | 358 | 45.36 |
| Jacobus E. Rooda | 3 | 165 | 13.07 |