Optimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency

TL;DR

This paper introduces G-control consistency (GCC), a new property that simplifies the synthesis of optimal non-blocking decentralized supervisors in discrete event systems by replacing traditional language-based conditions.

Contribution

It defines G-control consistency and demonstrates its use in synthesizing decentralized supervisors, relaxing previous conditions and improving computational efficiency.

Findings

GCC property enables optimal decentralized control synthesis.

GCC relaxes conditions compared to L-OCC and Lm-observer properties.

Method reduces computational complexity in supervisory control.

Abstract

Supervisory control synthesis encounters with computational complexity. This can be reduced by decentralized supervisory control approach. In this paper, we define intrinsic control consistency for a pair of states of the plant. G-control consistency (GCC) is another concept which is defined for a natural projection w.r.t. the plant. We prove that, if a natural projection is output control consistent for the closed language of the plant, and is a natural observer for the marked language of the plant, then it is G-control consistent. Namely, we relax the conditions for synthesis the optimal non-blocking decentralized supervisory control by substituting GCC property for L-OCC and Lm-observer properties of a natural projection. We propose a method to synthesize the optimal non-blocking decentralized supervisory control based on GCC property for a natural projection. In fact, we change the approach from language-based properties of a natural projection to DES-based property by defining GCC property.