Symbolic Supervisory Control of Distributed Systems with Communications - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Automatic Control Year : 2014

Symbolic Supervisory Control of Distributed Systems with Communications

(1) , (2) , (3) , (1)


We consider the control of distributed systems composed of subsystems communicating asynchronously; the aim is to build local controllers that restrict the behavior of a distributed system in order to satisfy a global state avoidance property. We model distributed systems as communicating finite state machines with reliable unbounded FIFO queues between subsystems. Local controllers can only observe the behavior of their proper subsystem and do not see the queue contents. To refine their control policy, controllers can use the FIFO queues to communicate by piggy-backing extra information (some timestamps and their state estimates) to the messages sent by the subsystems. We provide an algorithm that computes, for each local subsystem (and thus for each controller), during the execution of the system, an estimate of the current global state of the distributed system. We then define a synthesis algorithm to compute local controllers. Our method relies on the compu- tation of (co-)reachable states. Since the reachability problem is undecidable in our model, we use abstract interpretation techniques to obtain overapproximations of (co-)reachable states. An implementation of our algorithms provides an empirical evaluation of our method.
Fichier principal
Vignette du fichier
tac.pdf (603.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00903452 , version 1 (10-02-2014)



Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, Thierry Massart. Symbolic Supervisory Control of Distributed Systems with Communications. IEEE Transactions on Automatic Control, 2014, 59, pp.396-408. ⟨10.1109/TAC.2013.2283093⟩. ⟨hal-00903452⟩
183 View
207 Download



Gmail Facebook Twitter LinkedIn More