Asynchronous Games over Tree Architectures

Blaise Genest (1) , Hugo Gimbert (2) , Anca Muscholl (2) , Igor Walukiewicz (2)

1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Domaines: Autre [cs.OH]

Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. 2013. ⟨hal-00684223v3⟩