Automatica, Vol.39, No.3, 429-440, 2003
Linear control of live marked graphs
Given a linear constraint on the firing vectors of a live marked graph with uncontrollable/unobservable transitions, bounded or unbounded, we apply linear programming techniques to compute the most liberal controller enforcing this constraint.
Keywords:marked graphs;firing vectors;linear constraints;supervision;liveness;polyhedra;linear programming