Linear Control of Live Marked Graphs
Résumé
Given a linear constraint on the firing vectors of a live marked graph (bounded or unbounded) with uncontrollable / unobservable transitions, we apply linear programming techniques to compute the most liberal controller enforcing this constraint. In the special case of strongly connected live marked graphs, we compute further on the most liberal controller that keeps the marked graph live and enforces the constraint.