Efficient nonconflict check by using automaton abstractions

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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-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.

    Original languageEnglish
    Title of host publicationProceedings of 10th European Control Conference (ECC'09), 23-26 August 2009, Budapest, Hungary
    Place of PublicationPiscataway
    PublisherInstitute of Electrical and Electronics Engineers
    Number of pages6
    ISBN (Print)978-3-9524173-9-3
    Publication statusPublished - 2009
    Event10th European Control Conference, ECC 2009 - Budapest, Hungary
    Duration: 23 Aug 200926 Aug 2009
    Conference number: 10


    Conference10th European Control Conference, ECC 2009
    Abbreviated titleECC 2009
    Internet address


    • Automaton abstraction
    • Discrete-event systems
    • Nonconflict
    • Nondeterministic finitestate automata


    Dive into the research topics of 'Efficient nonconflict check by using automaton abstractions'. Together they form a unique fingerprint.

    Cite this