Coarsest controllability-preserving plant minimization

J. Markovski

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (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.
    Original languageEnglish
    Title of host publicationProceedings of the 11th IFAC/IEEE Workshop on Discrete Event Systems ( WODES 2012), October 1 - 3, 2012, Guadalajara, Jalisco, Mexico ,
    Place of PublicationPergamon
    Publication statusPublished - 2012
    Event11th International Workshop on Discrete Event Systems (WODES 2012) - Hotel De Mendoza, Guadalajara, Mexico
    Duration: 1 Oct 20125 Oct 2012
    Conference number: 11


    Conference11th International Workshop on Discrete Event Systems (WODES 2012)
    Abbreviated titleWODES 2012
    Internet address


    Dive into the research topics of 'Coarsest controllability-preserving plant minimization'. Together they form a unique fingerprint.

    Cite this