Maximum permissive coordinated distributed supervisory control of nondeterministic discrete-event systems

Rong Su, J.H. Schuppen, van, J.E. Rooda

    Research output: Book/ReportReportAcademic

    77 Downloads (Pure)

    Abstract

    In supervisor synthesis achieving nonblockingness is a major computational challenge when a target system consists of a large number of local components. To overcome this difficulty we propose an approach to synthesize a coordinated distributed supervisor, where the plant is modeled by a collection of nondeterministic finite-state automata and the requirement is modeled by a collection of deterministic finite-state automata. The synthesis is based on a previously developed automaton abstraction technique. We provide a sufficient condition, which guarantees the maximum permissiveness of the synthesized coordinated distributed supervisor. In addition, we show that the problem of finding a coordinator with the minimum number of states is NP-hard.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Number of pages28
    Publication statusPublished - 2009

    Publication series

    NameSE report
    Volume2009-09
    ISSN (Print)1872-1567

    Fingerprint Dive into the research topics of 'Maximum permissive coordinated distributed supervisory control of nondeterministic discrete-event systems'. Together they form a unique fingerprint.

    Cite this