Computing Coarser Observation Ffunctions Using Control-Compatible States of Supervisor

The paper discusses the problem of computing coarser observation functions in supervisory control of discrete event systems. It is shown that when a supervisor that realizes a given language L has certain properties, L-realizability of a coarser observation function is equivalent to control-compatibility of the states in some subsets of the state space of the supervisor. This characterization is then used to devise an iterative procedure of computing coarser L-realizable observation functions, where supervisor reduction and L-realizability verification of an observation function are performed at each iteration.