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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/CCA.2011.6044447 | 2011 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS (CCA) |
Keywords | Field | DocType |
finite-state automata, time-weighted systems, makespan, controllability, harmony, heaps-of-pieces | Supervisor,Job shop scheduling,Controllability,Control theory,Computer science,Automaton,Control engineering,Heap (data structure),Finite-state machine,Execution time,Throughput | Conference |
ISSN | Citations | PageRank |
1085-1992 | 1 | 0.41 |
References | Authors | |
4 | 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 |