Computing supremal minimum-weight controllable and normal sublanguages
- R. Su,
- J.H. Schuppen, van,
- J.E. Rooda,
- M. Petreczky
Output:
Book/Report
Report
Academic
Open access
Information
Output type
Output:
Book/Report
Report
Academic
Original language
EnglishPublication milestones
- Published - 2009
Publication status
Published - 2009
Place of publication
EindhovenPublisher
Technische Universiteit EindhovenPublication series
- Publication series name: SE report
ISSN (Print): 1872-1567
Volume: 2009-03
Abstract
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.
Documents and Links
Final published version, 236.31 KB
Metrics
Metrics
Download statistics
Download count
131
