%0 Conference Proceedings
%F icalp13
%A Genest, B.
%A Gimbert, H.
%A Muscholl, A.
%A Walukiewicz, I.
%T Asynchronous Games over Tree Architectures
%B 40th International Colloquium on Automata, Languages and Programming (ICALP'13)
%E Springer, 
%V 7966
%P 275-286
%S LNCS
%C Riga, Latvia
%X We consider the distributed control problem in the setting of Zielonka asynchronous automata. Such automata are compositions of nite processes communicating via shared actions and evolving asyn- chronously. 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
%U http://www.irisa.fr/sumo/Publis/PDF/icalp13.pdf
%U http://dx.doi.org/10.1007/978-3-642-39212-2_26
%8 July
%D 2013