Nonconflict check by using sequential automaton abstractions

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

    Research output: Book/ReportReportAcademic

    65 Downloads (Pure)


    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 over relatively small automata, even though the original system can be fairly large.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Number of pages22
    Publication statusPublished - 2008

    Publication series

    NameSE report
    ISSN (Print)1872-1567


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

    Cite this