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

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

    Research output: Book/ReportReportAcademic

    174 Downloads (Pure)


    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.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Number of pages26
    Publication statusPublished - 2009

    Publication series

    NameSE report
    ISSN (Print)1872-1567


    Dive into the research topics of 'The synthesis of time optimal supervisors by using heaps-of-pieces'. Together they form a unique fingerprint.

    Cite this