Min-Plus realizable control design for partially observable timed event graphs under marking constraints

Abstract

This paper deals with a control problem of discrete event systems subject to capacity constraints. Combined use of timed event graphs and Min-Plus algebra is a well-known approach and efficient for handling timed behavior and mathematical modelling of discrete event systems. However, in current literature, many of control approaches assume that system states are fully observable, which is not the case in our study. Hence, we propose in this paper a feedback control method to guarantee the respect of marking constraints imposed for some paths of partially observable timed event graphs. We demonstrate that if each loop of the considered TEG contains at last one observable transition, we can derive a realisable control law satisfying a set of constraints.