Asynchronous Games over Tree Architectures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Asynchronous Games over Tree Architectures


We consider the distributed control problem in the setting of Zielonka asynchronous automata. Such automata are compositions of finite processes communicating via shared actions and evolving asynchronously. Most importantly, processes participating in a shared action can exchange complete information about their causal past. This gives more power to controllers, and avoids simple pathological undecidable cases as in the setting of Pnueli and Rosner. We show the decidability of the control problem for Zielonka automata over acyclic communication architectures. We provide also a matching lower bound, which is l-fold exponential, l being the height of the architecture tree.
Fichier principal
Vignette du fichier
GGMW13.pdf (763.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00916615 , version 1 (10-12-2013)



Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. ICALP - 40th International Colloquium on Automata, Languages, and Programming- 2013, Jul 2013, RIGA, Latvia. pp.275-286, ⟨10.1007/978-3-642-39212-2_26⟩. ⟨hal-00916615⟩
187 View
101 Download



Gmail Facebook X LinkedIn More