Linear control of live marked graphs (Q1868050): Difference between revisions

Given a linear constraint on the firing vectors of a live marked graph with uncontrollable/unobservable transitions, bounded or unbounded, the authors apply linear programming techniques to compute the most liberal controller enforcing this constraint. This approach is therefore different from the control based on monitor places, considered e.g. by \textit{K. Yamalidou, J. Moody, M. Lemmon} and \textit{P. Antsaklis} [Automatica 32, No. 1, 15-28 (1996; Zbl 0845.93034)], because the latter fails to deal with uncontrollable and unobservable transitions. The authors borrow the framework of vector discrete event systems considered by \textit{Y. Li} and \textit{W. M. Wonham} [IEEE Trans. Autom. Control 38, No. 8, 1214-1227 (1993; Zbl 0784.93007); ibid. 39, No. 3, 512-531 (1994; Zbl 0823.93003)], but analyze the more general control problem by restricting systems to live marked graphs. As close work, the paper by \textit{H. Chen} [Discrete Event Dyn. Syst. 10, No. 3, 233-249 (2000; Zbl 0958.93064)] can be mentioned. The distinction is in the consideration of unobservable transitions and more general constraints. On the other hand, the proposed controller provides only interpreted control (verification of controlled systems is problematic) and does not preserve liveness of the uncontrolled net. Some interesting examples are given to illustrate the results of the paper.