Computing supremal minimum-weight controllable and normal sublanguages

R. Su, J.H. Schuppen, van, J.E. Rooda, M. Petreczky

    Onderzoeksoutput: Boek/rapportRapportAcademic

    59 Downloads (Pure)

    Samenvatting

    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.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's24
    StatusGepubliceerd - 2009

    Publicatie series

    NaamSE report
    Volume2009-03
    ISSN van geprinte versie1872-1567

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Computing supremal minimum-weight controllable and normal sublanguages'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit