This paper investigates the supervisor synthesis for concurrent systems based on reduced system models with the intention of complexity reduction. It is assumed that the expected behavior (specification) is given on a subset of the system alphabet, and the system behavior is reduced to this alphabet. Supervisors are computed for each reduced subsystem employing the modular approach in Komenda et al. (2005) and the decentralized approach in Lee and Wong (2002). Depending on the chosen architecture, we provide sufficient conditions for the consistent implementation of the reduced supervisors for the original system
Published in:
Discrete Event Systems, 2006 8th International Workshop on
Date of Conference: 10-12 July 2006