An algorithm for computing supremal nonblocking state-normal supervisors for nondeterministic systems

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

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    1 Downloads (Pure)

    Samenvatting

    Recently supervisor synthesis for nondeterministic systems has gained more and more attention, owing to the potential computational advantage of using nondeterministic automata in modular/distributed synthesis. It is well known that, in the Ramadge/Wonham language-based supervisory control paradigm, the supremal nonblocking normal supervisor always exists (although may be empty) and is computable. In this paper we will show that, for a nondeterministic plant model and a deterministic specification, a similar entity called the supremal nonblocking state-normal supervisor also exists, which coincides with the supremal nonblocking normal supervisor when the plant model becomes deterministic. We then present a concrete algorithm to compute such a supervisor and analyze the relevant computational complexity.
    Originele taal-2Engels
    TitelThe 17th Mediterranean Conference on Control and Automation (MED'09), June 24-26, 2009, Thessaloniki Greece
    Plaats van productiePiscataway
    UitgeverijInstitute of Electrical and Electronics Engineers
    Pagina's1120-1125
    ISBN van geprinte versie978-1-4244-4684-1
    DOI's
    StatusGepubliceerd - 2009

    Vingerafdruk

    Duik in de onderzoeksthema's van 'An algorithm for computing supremal nonblocking state-normal supervisors for nondeterministic systems'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit