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. © 2013 Springer-Verlag.
CITATION STYLE
Genest, B., Gimbert, H., Muscholl, A., & Walukiewicz, I. (2013). Asynchronous games over tree architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7966 LNCS, pp. 275–286). https://doi.org/10.1007/978-3-642-39212-2_26
Mendeley helps you to discover research relevant for your work.