Skip to Main content Skip to Navigation

Symbolic Supervisory Control of Distributed Systems with Communications

Abstract : 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 \emph{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 computation 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.
Document type :
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Hervé Marchand Connect in order to contact the contributor
Submitted on : Monday, March 18, 2013 - 3:09:27 PM
Last modification on : Wednesday, February 2, 2022 - 3:53:14 PM
Long-term archiving on: : Sunday, April 2, 2017 - 2:16:15 PM


Files produced by the author(s)


  • HAL Id : hal-00801840, version 1


Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, Thierry Massart. Symbolic Supervisory Control of Distributed Systems with Communications. [Research Report] RR-8260, INRIA. 2013. ⟨hal-00801840⟩



Record views


Files downloads