The synthesis of time optimal supervisors by using heaps-of-pieces

Rong Su, J.E. Rooda, J.H. Schuppen, van

    Onderzoeksoutput: Boek/rapportRapportAcademic

    217 Downloads (Pure)

    Samenvatting

    In many practical applications we are asked to compute a nonblocking supervisor that not only complies with some prescribed safety and liveness requirements but also achieve a certain time optimal performance such as throughput. In this paper we first introduce the concept of supremal minimum-time controllable sublanguage and define a minimumtime supervisory control problem, where the plant is modeled as a finite collection of finite-state automata, whose events are associated with weights, which represent their respective execution time. Then we show that the supremal minimum-time controllable sublanguage can be obtained by a terminable algorithm, where the execution time of each string is computed by using a technique extended from the theory of heaps-of-pieces.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's26
    StatusGepubliceerd - 2009

    Publicatie series

    NaamSE report
    Volume2009-08
    ISSN van geprinte versie1872-1567

    Vingerafdruk

    Duik in de onderzoeksthema's van 'The synthesis of time optimal supervisors by using heaps-of-pieces'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit