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 exist, and can be computed by a terminable algorithm.
Naam | SE report |
---|
Volume | 2009-03 |
---|
ISSN van geprinte versie | 1872-1567 |
---|