• DocumentCode
    2409123
  • Title

    A Distributed Supervisor Synthesis Approach Based on Weak Bisimulation

  • Author

    Su, Rong ; Thistle, John G.

  • Author_Institution
    Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Eidnhoven
  • fYear
    2006
  • fDate
    10-12 July 2006
  • Firstpage
    64
  • Lastpage
    69
  • Abstract
    It is well known that space and time complexity is one of the main bottlenecks of supervisor synthesis. The model of a large system is usually too big to be explicitly expressed, owing to composition of local components´ models, making supervisor synthesis difficult, if still possible. In this paper, we propose a distributed supervisor synthesis approach, where instead of computing a model of the entire system, a local abstraction of the system with respect to each local component is computed based on weak bisimulation. Then a local supervisor for each component is computed based on the component model and the abstract system model, by using well developed centralized supervisor synthesis approaches. The collection of all resulting local supervisors forms a distributed supervisor
  • Keywords
    bisimulation equivalence; computational complexity; control system synthesis; abstract system model; centralized supervisor synthesis; component model; distributed supervisor synthesis; space complexity; system local abstraction; time complexity; weak bisimulation; Automata; Boolean functions; Centralized control; Computational complexity; Control system synthesis; Control theory; Data structures; Distributed computing; Encoding; Network synthesis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Discrete Event Systems, 2006 8th International Workshop on
  • Conference_Location
    Ann Arbor, MI
  • Print_ISBN
    1-4244-0053-8
  • Type

    conf

  • DOI
    10.1109/WODES.2006.1678409
  • Filename
    1678409