A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems

The problem under consideration in this paper is that of enforcement by supervisory control of a given property on a partially-observed discrete-event system. We present a general methodology that is applicable to a large class of properties previously studied (individually) in the literature. These properties include, but are not restricted to, safety, diagnosability, opacity, detectability, anonymity and attractability. When the given system does not satisfy the considered property, the objective is to synthesize a supervisor that restricts the system's behavior and provably enforces the given property; moreover, it is required that this supervisor be maximally permissive. We consider the general case where the system's events are partitioned into observable and unobservable events, and controllable and uncontrollable events, and we do not make any assumptions about these two partitions; in particular, we do not assume that all controllable events are observable. Our uniform approach first maps the considered property to a suitably-defined information state for the partially-observed system and then develops a supervisor synthesis methodology based on a finite bipartite transition system that embeds all reachable information states and all admissible supervisory control strategies. This transition system is called the All Enforcement Structure (or AES). We present an algorithm for the construction of the AES and discuss its properties. Then we use the AES to develop a synthesis algorithm that constructs a supervisor that is provably property enforcing and maximally permissive. We illustrate the application of our uniform approach to the enforcement of the above-mentioned properties.