Computing supremal minimum-weight controllable and normal sublanguages
Rong Su, van Jh Jan Schuppen, JE Koos Rooda, Mihály Petreczky · 2009
In practical applications we are frequently required to find a supervisor that can achieve certain optimal performance. Some performance such as maximum throughput or minimum execution time/cost can be specified in terms of weights. In this paper we first define a minimum-weight supervisory control problem on weighted discrete-event systems. Then we show that, the supremal minimum-weight controllable and normal sublanguages In many practical applications we are frequently required to develop a controller that can not only enforce safety and liveliness related specifications, but also achieve certain optimal performance. For example, in semiconductor industry cluster tools are used to process wafers. A typical requirement is that, the system should not deadlock or livelock,