Deadlock free control synthesis for partially controllable marked graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Deadlock free control synthesis for partially controllable marked graphs

Abstract

This paper deals with the problem of deadlock avoidance in control synthesis for a discrete event systems modeled by marked graphs. The specifications are modeled by General Mutual Exclusion Constraints. We show that, even that the system to be controlled is live, the restriction introduced by the controller may generate deadlocks. Therefore, the research work we present in this paper focuses on enhancing an existing control synthesis technique in order to provide a deadlock free maximal permissive control law.

Dates and versions

inria-00600962 , version 1 (16-06-2011)

Identifiers

Cite

Hatem Sioud, Alexandre Sava, Z. Achour, Nidhal Rezg. Deadlock free control synthesis for partially controllable marked graphs. 12th IFAC Symposium on Large Scale Systems: Theory and Applications - LSS 2010, 2010, Lille, France. ⟨10.3182/20100712-3-FR-2020.00030⟩. ⟨inria-00600962⟩
68 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More