A distributed supervisor synthesis approach based on weak bisimulation

Rong Su, J.G. Thistle

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

27 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings 8th International Workshop on Discrete Event Systems (WODES'06, Ann Arbor MI, USA, July 10-12, 2006)
EditorsS. Lafortune, F. Lin, D. Tilbury
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages64-69
ISBN (Print)1-424-40053-8
DOIs
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'A distributed supervisor synthesis approach based on weak bisimulation'. Together they form a unique fingerprint.

Cite this