HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Linear Control of Live Marked Graphs

Philippe Darondeau 1 Xiaolan Xie 2
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 8:25:53 PM
Last modification on : Friday, February 4, 2022 - 4:06:54 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:04:27 PM


  • HAL Id : inria-00072337, version 1


Philippe Darondeau, Xiaolan Xie. Linear Control of Live Marked Graphs. [Research Report] RR-4251, INRIA. 2001, pp.24. ⟨inria-00072337⟩



Record views


Files downloads