Coarsest controllability-preserving plant minimization

J. Markovski

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    3 Citaten (Scopus)


    We define a controllability-preserving plant minimization and investigate its feasibility with respect to supervisor synthesis. A recent process-theoretic approach to supervisory control theory identified a so-called partial bisimulation preorder as a suitable behavioral relation to capture the notion of controllability for (nondeterministic) discrete-event systems. The equivalence relation, induced by the partial bisimulation preorder, can then be employed to minimize the unsupervised system, referred to as plant, by obtaining the coarsest quotient and optimize the process of supervisor synthesis. We present an efficient minimization algorithm for computing the partial bisimulation equivalence by partitioning the state space of the plant. We apply the algorithm to several experimental case studies and study the obtained gain.
    Originele taal-2Engels
    TitelProceedings of the 11th IFAC/IEEE Workshop on Discrete Event Systems ( WODES 2012), October 1 - 3, 2012, Guadalajara, Jalisco, Mexico ,
    Plaats van productiePergamon
    StatusGepubliceerd - 2012
    Evenement11th International Workshop on Discrete Event Systems (WODES 2012) - Hotel De Mendoza, Guadalajara, Mexico
    Duur: 1 okt 20125 okt 2012
    Congresnummer: 11


    Congres11th International Workshop on Discrete Event Systems (WODES 2012)
    Verkorte titelWODES 2012
    AnderWODES 2012
    Internet adres

    Vingerafdruk Duik in de onderzoeksthema's van 'Coarsest controllability-preserving plant minimization'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit