Efficient nonconflict check by using automaton abstractions

R. Su, J.H. Van Schuppen, J.E. Rooda, A.T. Hofkamp

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review


    In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original system can be fairly large.

    Originele taal-2Engels
    TitelProceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary
    Plaats van productiePiscataway
    UitgeverijInstitute of Electrical and Electronics Engineers
    Aantal pagina's6
    ISBN van geprinte versie978-3-9524173-9-3
    StatusGepubliceerd - 2009
    Evenement10th European Control Conference, ECC 2009 - Budapest, Hongarije
    Duur: 23 aug. 200926 aug. 2009
    Congresnummer: 10


    Congres10th European Control Conference, ECC 2009
    Verkorte titelECC 2009
    Internet adres


    Duik in de onderzoeksthema's van 'Efficient nonconflict check by using automaton abstractions'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit